./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.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-complex/safestack_relacy.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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:41:17,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:41:17,585 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:41:17,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:41:17,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:41:17,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:41:17,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:41:17,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:41:17,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:41:17,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:41:17,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:41:17,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:41:17,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:41:17,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:41:17,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:41:17,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:41:17,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:41:17,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:41:17,607 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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-01-10 06:41:17,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:41:17,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:41:17,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:41:17,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:41:17,849 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:41:17,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-01-10 06:41:19,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3ca94f96/038885977a684cacbeac57c0228a768e/FLAGe05eb40e7 [2025-01-10 06:41:19,492 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:41:19,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-01-10 06:41:19,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3ca94f96/038885977a684cacbeac57c0228a768e/FLAGe05eb40e7 [2025-01-10 06:41:19,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3ca94f96/038885977a684cacbeac57c0228a768e [2025-01-10 06:41:19,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:41:19,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:41:19,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:41:19,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:41:19,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:41:19,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:41:19" (1/1) ... [2025-01-10 06:41:19,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:19, skipping insertion in model container [2025-01-10 06:41:19,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:41:19" (1/1) ... [2025-01-10 06:41:19,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:41:20,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:41:20,044 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:41:20,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:41:20,202 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:41:20,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20 WrapperNode [2025-01-10 06:41:20,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:41:20,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:41:20,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:41:20,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:41:20,211 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:41:20" (1/1) ... [2025-01-10 06:41:20,227 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:41:20" (1/1) ... [2025-01-10 06:41:20,254 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-01-10 06:41:20,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:41:20,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:41:20,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:41:20,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:41:20,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,281 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-01-10 06:41:20,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:41:20,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:41:20,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:41:20,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:41:20,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (1/1) ... [2025-01-10 06:41:20,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:41:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:20,331 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:41:20,335 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:41:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:41:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:41:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:41:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-10 06:41:20,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:41:20,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:41:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:41:20,356 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:41:20,558 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:41:20,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:41:20,783 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:41:20,784 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:41:20,954 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:41:20,954 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:41:20,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:41:20 BoogieIcfgContainer [2025-01-10 06:41:20,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:41:20,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:41:20,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:41:20,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:41:20,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:41:19" (1/3) ... [2025-01-10 06:41:20,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3b709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:41:20, skipping insertion in model container [2025-01-10 06:41:20,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:20" (2/3) ... [2025-01-10 06:41:20,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3b709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:41:20, skipping insertion in model container [2025-01-10 06:41:20,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:41:20" (3/3) ... [2025-01-10 06:41:20,961 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-01-10 06:41:20,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:41:20,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 69 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-01-10 06:41:20,974 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:41:21,035 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:41:21,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 81 transitions, 169 flow [2025-01-10 06:41:21,083 INFO L124 PetriNetUnfolderBase]: 12/85 cut-off events. [2025-01-10 06:41:21,085 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:41:21,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 85 events. 12/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 199 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 3 conditions per place. [2025-01-10 06:41:21,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 81 transitions, 169 flow [2025-01-10 06:41:21,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 80 transitions, 167 flow [2025-01-10 06:41:21,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:41:21,112 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;@4af648e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:41:21,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:41:21,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:41:21,119 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:41:21,119 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:41:21,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:21,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:41:21,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:21,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash 484263161, now seen corresponding path program 1 times [2025-01-10 06:41:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101239988] [2025-01-10 06:41:21,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:21,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:41:21,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:41:21,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:21,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:21,553 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:41:21,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101239988] [2025-01-10 06:41:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101239988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:41:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068682429] [2025-01-10 06:41:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:21,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:21,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:21,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:21,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 81 [2025-01-10 06:41:21,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:41:21,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:21,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 81 [2025-01-10 06:41:21,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:21,788 INFO L124 PetriNetUnfolderBase]: 193/436 cut-off events. [2025-01-10 06:41:21,788 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:41:21,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 436 events. 193/436 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1713 event pairs, 150 based on Foata normal form. 2/340 useless extension candidates. Maximal degree in co-relation 759. Up to 367 conditions per place. [2025-01-10 06:41:21,795 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 44 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-01-10 06:41:21,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 247 flow [2025-01-10 06:41:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-01-10 06:41:21,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5596707818930041 [2025-01-10 06:41:21,816 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 167 flow. Second operand 3 states and 136 transitions. [2025-01-10 06:41:21,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 247 flow [2025-01-10 06:41:21,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:41:21,824 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 159 flow [2025-01-10 06:41:21,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-01-10 06:41:21,830 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2025-01-10 06:41:21,831 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 159 flow [2025-01-10 06:41:21,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:41:21,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:21,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:41:21,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:41:21,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:21,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2127256615, now seen corresponding path program 1 times [2025-01-10 06:41:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036722340] [2025-01-10 06:41:21,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:21,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:41:21,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:41:21,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:21,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:21,973 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:41:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036722340] [2025-01-10 06:41:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036722340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:41:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970996669] [2025-01-10 06:41:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:21,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:21,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:21,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 81 [2025-01-10 06:41:21,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:41:21,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:21,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 81 [2025-01-10 06:41:21,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:22,102 INFO L124 PetriNetUnfolderBase]: 193/434 cut-off events. [2025-01-10 06:41:22,103 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:41:22,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 434 events. 193/434 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1714 event pairs, 150 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 780. Up to 367 conditions per place. [2025-01-10 06:41:22,106 INFO L140 encePairwiseOnDemand]: 77/81 looper letters, 42 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-01-10 06:41:22,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 243 flow [2025-01-10 06:41:22,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 06:41:22,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349794238683128 [2025-01-10 06:41:22,109 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 159 flow. Second operand 3 states and 130 transitions. [2025-01-10 06:41:22,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 243 flow [2025-01-10 06:41:22,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:22,114 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 155 flow [2025-01-10 06:41:22,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2025-01-10 06:41:22,116 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-01-10 06:41:22,116 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 155 flow [2025-01-10 06:41:22,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:41:22,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:22,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:22,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:41:22,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:22,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash -110810380, now seen corresponding path program 1 times [2025-01-10 06:41:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174467537] [2025-01-10 06:41:22,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:22,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:41:22,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:41:22,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:22,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:22,234 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:41:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174467537] [2025-01-10 06:41:22,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174467537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:22,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:41:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027968447] [2025-01-10 06:41:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:22,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:22,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:22,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:22,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 81 [2025-01-10 06:41:22,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 155 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:41:22,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:22,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 81 [2025-01-10 06:41:22,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:22,409 INFO L124 PetriNetUnfolderBase]: 194/450 cut-off events. [2025-01-10 06:41:22,409 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:41:22,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 450 events. 194/450 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1828 event pairs, 150 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 780. Up to 377 conditions per place. [2025-01-10 06:41:22,414 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 48 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2025-01-10 06:41:22,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 267 flow [2025-01-10 06:41:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-01-10 06:41:22,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761316872427984 [2025-01-10 06:41:22,417 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 155 flow. Second operand 3 states and 140 transitions. [2025-01-10 06:41:22,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 267 flow [2025-01-10 06:41:22,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:22,421 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 172 flow [2025-01-10 06:41:22,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2025-01-10 06:41:22,422 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-01-10 06:41:22,422 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 172 flow [2025-01-10 06:41:22,422 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:41:22,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:22,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:22,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:41:22,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:22,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 488399681, now seen corresponding path program 1 times [2025-01-10 06:41:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:22,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237297152] [2025-01-10 06:41:22,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:22,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:41:22,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:41:22,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:22,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:22,509 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:41:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237297152] [2025-01-10 06:41:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237297152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91763040] [2025-01-10 06:41:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:22,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:22,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 81 [2025-01-10 06:41:22,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:41:22,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:22,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 81 [2025-01-10 06:41:22,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:22,643 INFO L124 PetriNetUnfolderBase]: 194/448 cut-off events. [2025-01-10 06:41:22,644 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:41:22,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 448 events. 194/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1818 event pairs, 150 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 780. Up to 380 conditions per place. [2025-01-10 06:41:22,645 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 51 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-01-10 06:41:22,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 288 flow [2025-01-10 06:41:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2025-01-10 06:41:22,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2025-01-10 06:41:22,647 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 172 flow. Second operand 4 states and 161 transitions. [2025-01-10 06:41:22,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 288 flow [2025-01-10 06:41:22,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 77 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:41:22,648 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 190 flow [2025-01-10 06:41:22,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2025-01-10 06:41:22,649 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2025-01-10 06:41:22,649 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 190 flow [2025-01-10 06:41:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:41:22,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:22,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:22,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:41:22,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:22,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:22,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1610579836, now seen corresponding path program 1 times [2025-01-10 06:41:22,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:22,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572647800] [2025-01-10 06:41:22,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:22,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:41:22,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:41:22,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:22,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:22,703 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:41:22,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:22,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572647800] [2025-01-10 06:41:22,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572647800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:22,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:41:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395583068] [2025-01-10 06:41:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:22,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:22,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:22,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 81 [2025-01-10 06:41:22,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:41:22,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:22,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 81 [2025-01-10 06:41:22,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:22,845 INFO L124 PetriNetUnfolderBase]: 162/399 cut-off events. [2025-01-10 06:41:22,845 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 06:41:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 399 events. 162/399 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1676 event pairs, 77 based on Foata normal form. 28/366 useless extension candidates. Maximal degree in co-relation 706. Up to 202 conditions per place. [2025-01-10 06:41:22,847 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 69 selfloop transitions, 4 changer transitions 4/100 dead transitions. [2025-01-10 06:41:22,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 390 flow [2025-01-10 06:41:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 06:41:22,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707818930041153 [2025-01-10 06:41:22,848 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 190 flow. Second operand 3 states and 163 transitions. [2025-01-10 06:41:22,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 390 flow [2025-01-10 06:41:22,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:22,850 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 171 flow [2025-01-10 06:41:22,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-01-10 06:41:22,851 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-01-10 06:41:22,851 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 171 flow [2025-01-10 06:41:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:41:22,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:22,851 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:22,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:41:22,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:22,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash 791881281, now seen corresponding path program 1 times [2025-01-10 06:41:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104667820] [2025-01-10 06:41:22,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:22,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:22,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:22,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:22,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104667820] [2025-01-10 06:41:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104667820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099667054] [2025-01-10 06:41:22,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:22,937 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:41:22,937 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:41:23,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:23,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:23,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:23,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:23,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:41:23,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:23,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:41:23,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099667054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:23,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:41:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 06:41:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324711800] [2025-01-10 06:41:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:23,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:23,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:23,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:41:23,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 81 [2025-01-10 06:41:23,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:41:23,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:23,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 81 [2025-01-10 06:41:23,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:23,217 INFO L124 PetriNetUnfolderBase]: 132/314 cut-off events. [2025-01-10 06:41:23,218 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 06:41:23,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 314 events. 132/314 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1152 event pairs, 100 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 611. Up to 257 conditions per place. [2025-01-10 06:41:23,219 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 42 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-01-10 06:41:23,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 261 flow [2025-01-10 06:41:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-10 06:41:23,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2025-01-10 06:41:23,221 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 171 flow. Second operand 4 states and 148 transitions. [2025-01-10 06:41:23,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 261 flow [2025-01-10 06:41:23,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:41:23,223 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 173 flow [2025-01-10 06:41:23,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-01-10 06:41:23,223 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-01-10 06:41:23,223 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 173 flow [2025-01-10 06:41:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:41:23,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:23,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:23,234 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:41:23,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:23,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1221483559, now seen corresponding path program 1 times [2025-01-10 06:41:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783961602] [2025-01-10 06:41:23,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:23,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:41:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:41:23,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:23,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783961602] [2025-01-10 06:41:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783961602] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348708090] [2025-01-10 06:41:23,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:23,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:23,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:23,557 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:41:23,558 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:41:23,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:41:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:41:23,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:23,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:23,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:41:23,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:23,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:41:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348708090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:23,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:41:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865830498] [2025-01-10 06:41:23,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:23,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:41:23,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:23,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:41:23,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:41:23,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 81 [2025-01-10 06:41:23,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 173 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 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:41:23,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:23,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 81 [2025-01-10 06:41:23,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:23,922 INFO L124 PetriNetUnfolderBase]: 134/338 cut-off events. [2025-01-10 06:41:23,922 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 06:41:23,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 338 events. 134/338 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1273 event pairs, 100 based on Foata normal form. 3/310 useless extension candidates. Maximal degree in co-relation 587. Up to 262 conditions per place. [2025-01-10 06:41:23,924 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 51 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2025-01-10 06:41:23,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 337 flow [2025-01-10 06:41:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:41:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:41:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2025-01-10 06:41:23,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42151675485008816 [2025-01-10 06:41:23,930 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 173 flow. Second operand 7 states and 239 transitions. [2025-01-10 06:41:23,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 337 flow [2025-01-10 06:41:23,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:41:23,934 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 226 flow [2025-01-10 06:41:23,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-01-10 06:41:23,935 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2025-01-10 06:41:23,935 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 226 flow [2025-01-10 06:41:23,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 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:41:23,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:23,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:23,948 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:41:24,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:24,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:24,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1704766026, now seen corresponding path program 1 times [2025-01-10 06:41:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:24,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873331583] [2025-01-10 06:41:24,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:24,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:41:24,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:41:24,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:24,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:24,230 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:41:24,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873331583] [2025-01-10 06:41:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873331583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:24,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886919683] [2025-01-10 06:41:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:24,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:24,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:24,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:24,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 81 [2025-01-10 06:41:24,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:41:24,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:24,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 81 [2025-01-10 06:41:24,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:24,384 INFO L124 PetriNetUnfolderBase]: 133/333 cut-off events. [2025-01-10 06:41:24,384 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-01-10 06:41:24,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 333 events. 133/333 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1233 event pairs, 100 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 638. Up to 255 conditions per place. [2025-01-10 06:41:24,386 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 43 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-01-10 06:41:24,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 317 flow [2025-01-10 06:41:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-01-10 06:41:24,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2025-01-10 06:41:24,387 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 226 flow. Second operand 4 states and 143 transitions. [2025-01-10 06:41:24,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 317 flow [2025-01-10 06:41:24,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 301 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:24,389 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 217 flow [2025-01-10 06:41:24,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-01-10 06:41:24,392 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2025-01-10 06:41:24,392 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 217 flow [2025-01-10 06:41:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:41:24,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:24,392 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:41:24,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:24,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2093569705, now seen corresponding path program 1 times [2025-01-10 06:41:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350784227] [2025-01-10 06:41:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:24,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:41:24,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:41:24,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:24,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:24,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350784227] [2025-01-10 06:41:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350784227] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130371440] [2025-01-10 06:41:24,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:24,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:24,521 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:41:24,522 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:41:24,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:41:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:41:24,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:24,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:24,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:41:24,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:24,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:41:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130371440] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:24,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:24,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:41:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158836633] [2025-01-10 06:41:24,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:41:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:24,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:41:24,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:41:24,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-01-10 06:41:24,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 217 flow. Second operand has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 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:41:24,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:24,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-01-10 06:41:24,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:24,994 INFO L124 PetriNetUnfolderBase]: 132/328 cut-off events. [2025-01-10 06:41:24,994 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 06:41:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 328 events. 132/328 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1109 event pairs, 100 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 631. Up to 254 conditions per place. [2025-01-10 06:41:24,996 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 47 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-01-10 06:41:24,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 328 flow [2025-01-10 06:41:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:41:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:41:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-01-10 06:41:24,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.345679012345679 [2025-01-10 06:41:24,998 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 217 flow. Second operand 7 states and 196 transitions. [2025-01-10 06:41:24,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 328 flow [2025-01-10 06:41:24,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:41:25,000 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 231 flow [2025-01-10 06:41:25,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2025-01-10 06:41:25,001 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2025-01-10 06:41:25,001 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 231 flow [2025-01-10 06:41:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 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:41:25,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:25,001 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:41:25,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:41:25,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:25,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1875231790, now seen corresponding path program 1 times [2025-01-10 06:41:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:25,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907683892] [2025-01-10 06:41:25,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:25,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:41:25,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:41:25,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:25,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:41:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907683892] [2025-01-10 06:41:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907683892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836961749] [2025-01-10 06:41:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:25,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:25,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:25,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:25,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 81 [2025-01-10 06:41:25,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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:41:25,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:25,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 81 [2025-01-10 06:41:25,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:25,354 INFO L124 PetriNetUnfolderBase]: 132/327 cut-off events. [2025-01-10 06:41:25,354 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-01-10 06:41:25,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 327 events. 132/327 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1101 event pairs, 100 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 641. Up to 263 conditions per place. [2025-01-10 06:41:25,356 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 43 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2025-01-10 06:41:25,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 68 transitions, 333 flow [2025-01-10 06:41:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-01-10 06:41:25,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-01-10 06:41:25,357 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 231 flow. Second operand 4 states and 147 transitions. [2025-01-10 06:41:25,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 68 transitions, 333 flow [2025-01-10 06:41:25,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 320 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:41:25,359 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 242 flow [2025-01-10 06:41:25,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2025-01-10 06:41:25,360 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-01-10 06:41:25,360 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 242 flow [2025-01-10 06:41:25,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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:41:25,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:25,360 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 06:41:25,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:41:25,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2101656967, now seen corresponding path program 2 times [2025-01-10 06:41:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776982968] [2025-01-10 06:41:25,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:41:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:25,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:41:25,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 36 statements. [2025-01-10 06:41:25,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:41:25,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 06:41:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:25,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776982968] [2025-01-10 06:41:25,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776982968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:25,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:25,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902333047] [2025-01-10 06:41:25,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:25,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:25,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:25,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:25,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-01-10 06:41:25,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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:41:25,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:25,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-01-10 06:41:25,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:25,526 INFO L124 PetriNetUnfolderBase]: 132/326 cut-off events. [2025-01-10 06:41:25,527 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-10 06:41:25,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 326 events. 132/326 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1090 event pairs, 100 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 651. Up to 254 conditions per place. [2025-01-10 06:41:25,528 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 46 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2025-01-10 06:41:25,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 69 transitions, 350 flow [2025-01-10 06:41:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-01-10 06:41:25,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2025-01-10 06:41:25,529 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 242 flow. Second operand 4 states and 130 transitions. [2025-01-10 06:41:25,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 69 transitions, 350 flow [2025-01-10 06:41:25,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 330 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:41:25,531 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 247 flow [2025-01-10 06:41:25,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-01-10 06:41:25,532 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2025-01-10 06:41:25,532 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 247 flow [2025-01-10 06:41:25,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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:41:25,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:25,532 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:25,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:41:25,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:25,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash 824592618, now seen corresponding path program 2 times [2025-01-10 06:41:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388979786] [2025-01-10 06:41:25,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:41:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:25,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:41:25,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:41:25,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:41:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:41:25,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:41:25,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:41:25,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:41:25,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:25,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:41:25,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:41:25,591 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:41:25,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:41:25,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:41:25,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:41:25,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:41:25,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:41:25,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:41:25,596 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:25,598 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:41:25,598 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:41:25,635 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:41:25,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 120 transitions, 256 flow [2025-01-10 06:41:25,651 INFO L124 PetriNetUnfolderBase]: 23/147 cut-off events. [2025-01-10 06:41:25,651 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:41:25,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 147 events. 23/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 478 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2025-01-10 06:41:25,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 120 transitions, 256 flow [2025-01-10 06:41:25,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 120 transitions, 256 flow [2025-01-10 06:41:25,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:41:25,654 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;@4af648e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:41:25,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:41:25,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:41:25,657 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:41:25,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:41:25,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:25,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:41:25,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 598779761, now seen corresponding path program 1 times [2025-01-10 06:41:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920554162] [2025-01-10 06:41:25,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:25,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:41:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:41:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:25,699 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:41:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920554162] [2025-01-10 06:41:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920554162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:41:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135332327] [2025-01-10 06:41:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:25,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:25,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:25,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-01-10 06:41:25,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 120 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:41:25,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:25,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-01-10 06:41:25,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:27,009 INFO L124 PetriNetUnfolderBase]: 11368/17471 cut-off events. [2025-01-10 06:41:27,010 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-01-10 06:41:27,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34056 conditions, 17471 events. 11368/17471 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 106584 event pairs, 9489 based on Foata normal form. 2/14152 useless extension candidates. Maximal degree in co-relation 26942. Up to 16439 conditions per place. [2025-01-10 06:41:27,092 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 76 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-01-10 06:41:27,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 394 flow [2025-01-10 06:41:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-01-10 06:41:27,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-01-10 06:41:27,094 INFO L175 Difference]: Start difference. First operand has 103 places, 120 transitions, 256 flow. Second operand 3 states and 186 transitions. [2025-01-10 06:41:27,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 394 flow [2025-01-10 06:41:27,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 111 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:41:27,096 INFO L231 Difference]: Finished difference. Result has 103 places, 111 transitions, 242 flow [2025-01-10 06:41:27,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=103, PETRI_TRANSITIONS=111} [2025-01-10 06:41:27,097 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 0 predicate places. [2025-01-10 06:41:27,097 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 242 flow [2025-01-10 06:41:27,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:41:27,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:27,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:41:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:41:27,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:27,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1382304039, now seen corresponding path program 1 times [2025-01-10 06:41:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-01-10 06:41:27,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:27,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:41:27,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:41:27,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:27,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:27,128 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:41:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-01-10 06:41:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166870798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:27,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:41:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816743581] [2025-01-10 06:41:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:27,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:27,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:27,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:27,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-01-10 06:41:27,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 111 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:41:27,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:27,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-01-10 06:41:27,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:28,246 INFO L124 PetriNetUnfolderBase]: 11368/17469 cut-off events. [2025-01-10 06:41:28,246 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-01-10 06:41:28,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34055 conditions, 17469 events. 11368/17469 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 106576 event pairs, 9489 based on Foata normal form. 2/14150 useless extension candidates. Maximal degree in co-relation 34019. Up to 16439 conditions per place. [2025-01-10 06:41:28,330 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 74 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-01-10 06:41:28,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 390 flow [2025-01-10 06:41:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-01-10 06:41:28,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2025-01-10 06:41:28,331 INFO L175 Difference]: Start difference. First operand has 103 places, 111 transitions, 242 flow. Second operand 3 states and 177 transitions. [2025-01-10 06:41:28,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 390 flow [2025-01-10 06:41:28,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:28,333 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 238 flow [2025-01-10 06:41:28,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2025-01-10 06:41:28,335 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -2 predicate places. [2025-01-10 06:41:28,335 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 238 flow [2025-01-10 06:41:28,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:41:28,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:28,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:28,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:41:28,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:28,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1249306356, now seen corresponding path program 1 times [2025-01-10 06:41:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308075651] [2025-01-10 06:41:28,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:28,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:41:28,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:41:28,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:28,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:28,380 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:41:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308075651] [2025-01-10 06:41:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308075651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:28,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:28,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:41:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338555295] [2025-01-10 06:41:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:28,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:28,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:28,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:28,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 120 [2025-01-10 06:41:28,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:41:28,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:28,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 120 [2025-01-10 06:41:28,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:29,370 INFO L124 PetriNetUnfolderBase]: 11369/17485 cut-off events. [2025-01-10 06:41:29,370 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-01-10 06:41:29,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34079 conditions, 17485 events. 11369/17485 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 106738 event pairs, 9489 based on Foata normal form. 2/14166 useless extension candidates. Maximal degree in co-relation 34019. Up to 16449 conditions per place. [2025-01-10 06:41:29,446 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 80 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-01-10 06:41:29,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 113 transitions, 414 flow [2025-01-10 06:41:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-01-10 06:41:29,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-01-10 06:41:29,447 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 238 flow. Second operand 3 states and 187 transitions. [2025-01-10 06:41:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 113 transitions, 414 flow [2025-01-10 06:41:29,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 113 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:29,449 INFO L231 Difference]: Finished difference. Result has 102 places, 111 transitions, 255 flow [2025-01-10 06:41:29,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=102, PETRI_TRANSITIONS=111} [2025-01-10 06:41:29,450 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2025-01-10 06:41:29,450 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 111 transitions, 255 flow [2025-01-10 06:41:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:41:29,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:29,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:29,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:41:29,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash -685212351, now seen corresponding path program 1 times [2025-01-10 06:41:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203638244] [2025-01-10 06:41:29,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:29,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:41:29,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:41:29,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:29,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:29,494 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:41:29,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203638244] [2025-01-10 06:41:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203638244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808137825] [2025-01-10 06:41:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:29,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:29,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 120 [2025-01-10 06:41:29,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 111 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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:41:29,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:29,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 120 [2025-01-10 06:41:29,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:30,432 INFO L124 PetriNetUnfolderBase]: 11369/17483 cut-off events. [2025-01-10 06:41:30,432 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-01-10 06:41:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34088 conditions, 17483 events. 11369/17483 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 106648 event pairs, 9489 based on Foata normal form. 2/14166 useless extension candidates. Maximal degree in co-relation 34019. Up to 16452 conditions per place. [2025-01-10 06:41:30,504 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 83 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-01-10 06:41:30,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 114 transitions, 435 flow [2025-01-10 06:41:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-01-10 06:41:30,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44375 [2025-01-10 06:41:30,507 INFO L175 Difference]: Start difference. First operand has 102 places, 111 transitions, 255 flow. Second operand 4 states and 213 transitions. [2025-01-10 06:41:30,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 114 transitions, 435 flow [2025-01-10 06:41:30,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 114 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:41:30,509 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 273 flow [2025-01-10 06:41:30,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2025-01-10 06:41:30,510 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2025-01-10 06:41:30,510 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 273 flow [2025-01-10 06:41:30,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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:41:30,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:30,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:30,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:41:30,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:30,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash -431521319, now seen corresponding path program 1 times [2025-01-10 06:41:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:30,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420051906] [2025-01-10 06:41:30,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:30,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:41:30,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:41:30,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:30,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:30,559 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:41:30,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420051906] [2025-01-10 06:41:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420051906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:41:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468820651] [2025-01-10 06:41:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:30,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:30,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:30,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-01-10 06:41:30,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:41:30,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:30,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-01-10 06:41:30,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:31,770 INFO L124 PetriNetUnfolderBase]: 13064/20186 cut-off events. [2025-01-10 06:41:31,770 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-01-10 06:41:31,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39063 conditions, 20186 events. 13064/20186 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 132604 event pairs, 5467 based on Foata normal form. 83/16714 useless extension candidates. Maximal degree in co-relation 39017. Up to 13739 conditions per place. [2025-01-10 06:41:31,901 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 141 selfloop transitions, 5 changer transitions 1/177 dead transitions. [2025-01-10 06:41:31,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 703 flow [2025-01-10 06:41:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-01-10 06:41:31,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-01-10 06:41:31,903 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 273 flow. Second operand 3 states and 250 transitions. [2025-01-10 06:41:31,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 703 flow [2025-01-10 06:41:31,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 177 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:31,906 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 296 flow [2025-01-10 06:41:31,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2025-01-10 06:41:31,907 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2025-01-10 06:41:31,907 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 296 flow [2025-01-10 06:41:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:41:31,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:31,907 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:41:31,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1098559161, now seen corresponding path program 1 times [2025-01-10 06:41:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017930257] [2025-01-10 06:41:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:31,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:31,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:31,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:31,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:31,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:31,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017930257] [2025-01-10 06:41:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017930257] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:31,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187445016] [2025-01-10 06:41:31,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:31,986 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:41:31,987 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:41:32,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:32,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:32,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:32,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:32,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:41:32,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:32,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:41:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187445016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:41:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 06:41:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783238362] [2025-01-10 06:41:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:32,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:32,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:41:32,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 120 [2025-01-10 06:41:32,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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:41:32,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:32,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 120 [2025-01-10 06:41:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:32,942 INFO L124 PetriNetUnfolderBase]: 9729/15045 cut-off events. [2025-01-10 06:41:32,942 INFO L125 PetriNetUnfolderBase]: For 3352/4802 co-relation queries the response was YES. [2025-01-10 06:41:32,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31132 conditions, 15045 events. 9729/15045 cut-off events. For 3352/4802 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 90945 event pairs, 8128 based on Foata normal form. 2/13550 useless extension candidates. Maximal degree in co-relation 31083. Up to 14181 conditions per place. [2025-01-10 06:41:33,032 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 78 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2025-01-10 06:41:33,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 458 flow [2025-01-10 06:41:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 06:41:33,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42291666666666666 [2025-01-10 06:41:33,034 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 296 flow. Second operand 4 states and 203 transitions. [2025-01-10 06:41:33,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 111 transitions, 458 flow [2025-01-10 06:41:33,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 111 transitions, 453 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:41:33,041 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 297 flow [2025-01-10 06:41:33,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2025-01-10 06:41:33,042 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2025-01-10 06:41:33,042 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 297 flow [2025-01-10 06:41:33,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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:41:33,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:33,042 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:33,049 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:41:33,242 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,SelfDestructingSolverStorable17 [2025-01-10 06:41:33,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -304403751, now seen corresponding path program 1 times [2025-01-10 06:41:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98040058] [2025-01-10 06:41:33,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:41:33,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:41:33,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:33,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98040058] [2025-01-10 06:41:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98040058] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755169847] [2025-01-10 06:41:33,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:33,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:33,312 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:41:33,313 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:41:33,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:41:33,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:41:33,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:33,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:33,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:41:33,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:33,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:41:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755169847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:33,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:41:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678824327] [2025-01-10 06:41:33,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:41:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:33,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:41:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:41:33,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 120 [2025-01-10 06:41:33,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 297 flow. Second operand has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 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:41:33,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:33,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 120 [2025-01-10 06:41:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:34,413 INFO L124 PetriNetUnfolderBase]: 9731/15069 cut-off events. [2025-01-10 06:41:34,414 INFO L125 PetriNetUnfolderBase]: For 1860/3310 co-relation queries the response was YES. [2025-01-10 06:41:34,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31101 conditions, 15069 events. 9731/15069 cut-off events. For 1860/3310 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 91264 event pairs, 8128 based on Foata normal form. 3/13573 useless extension candidates. Maximal degree in co-relation 31005. Up to 14186 conditions per place. [2025-01-10 06:41:34,526 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 87 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2025-01-10 06:41:34,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 123 transitions, 535 flow [2025-01-10 06:41:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:41:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:41:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 309 transitions. [2025-01-10 06:41:34,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2025-01-10 06:41:34,528 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 297 flow. Second operand 7 states and 309 transitions. [2025-01-10 06:41:34,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 123 transitions, 535 flow [2025-01-10 06:41:34,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 123 transitions, 513 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:41:34,533 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 352 flow [2025-01-10 06:41:34,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-01-10 06:41:34,534 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 11 predicate places. [2025-01-10 06:41:34,534 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 352 flow [2025-01-10 06:41:34,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 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:41:34,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:34,535 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:34,541 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:41:34,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:34,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1492426524, now seen corresponding path program 1 times [2025-01-10 06:41:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541248850] [2025-01-10 06:41:34,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:34,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:41:34,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:41:34,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:34,793 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:41:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541248850] [2025-01-10 06:41:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541248850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:34,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742779508] [2025-01-10 06:41:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:34,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:34,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:34,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:34,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-01-10 06:41:34,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:41:34,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:34,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-01-10 06:41:34,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:36,112 INFO L124 PetriNetUnfolderBase]: 11396/17675 cut-off events. [2025-01-10 06:41:36,112 INFO L125 PetriNetUnfolderBase]: For 2469/2469 co-relation queries the response was YES. [2025-01-10 06:41:36,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36623 conditions, 17675 events. 11396/17675 cut-off events. For 2469/2469 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 115344 event pairs, 4686 based on Foata normal form. 733/15910 useless extension candidates. Maximal degree in co-relation 36554. Up to 11284 conditions per place. [2025-01-10 06:41:36,184 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 195 selfloop transitions, 8 changer transitions 2/235 dead transitions. [2025-01-10 06:41:36,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 235 transitions, 1002 flow [2025-01-10 06:41:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2025-01-10 06:41:36,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-01-10 06:41:36,186 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 352 flow. Second operand 4 states and 334 transitions. [2025-01-10 06:41:36,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 235 transitions, 1002 flow [2025-01-10 06:41:36,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 235 transitions, 987 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:36,190 INFO L231 Difference]: Finished difference. Result has 113 places, 114 transitions, 345 flow [2025-01-10 06:41:36,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=113, PETRI_TRANSITIONS=114} [2025-01-10 06:41:36,190 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2025-01-10 06:41:36,190 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 114 transitions, 345 flow [2025-01-10 06:41:36,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:41:36,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:36,191 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:36,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:41:36,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:36,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash 979418673, now seen corresponding path program 1 times [2025-01-10 06:41:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403725935] [2025-01-10 06:41:36,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:36,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:41:36,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:41:36,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:36,220 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:41:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403725935] [2025-01-10 06:41:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403725935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:41:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934471874] [2025-01-10 06:41:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:36,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:36,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:36,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-01-10 06:41:36,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 114 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:41:36,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:36,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-01-10 06:41:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:36,982 INFO L124 PetriNetUnfolderBase]: 9815/15120 cut-off events. [2025-01-10 06:41:36,983 INFO L125 PetriNetUnfolderBase]: For 1394/1394 co-relation queries the response was YES. [2025-01-10 06:41:37,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32307 conditions, 15120 events. 9815/15120 cut-off events. For 1394/1394 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 89227 event pairs, 6583 based on Foata normal form. 1/13639 useless extension candidates. Maximal degree in co-relation 32238. Up to 11637 conditions per place. [2025-01-10 06:41:37,102 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 128 selfloop transitions, 8 changer transitions 8/172 dead transitions. [2025-01-10 06:41:37,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 172 transitions, 741 flow [2025-01-10 06:41:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:41:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:41:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-01-10 06:41:37,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-01-10 06:41:37,107 INFO L175 Difference]: Start difference. First operand has 113 places, 114 transitions, 345 flow. Second operand 3 states and 237 transitions. [2025-01-10 06:41:37,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 172 transitions, 741 flow [2025-01-10 06:41:37,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 172 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:37,118 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 327 flow [2025-01-10 06:41:37,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2025-01-10 06:41:37,119 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 9 predicate places. [2025-01-10 06:41:37,119 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 327 flow [2025-01-10 06:41:37,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:41:37,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:37,119 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:41:37,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 623526271, now seen corresponding path program 1 times [2025-01-10 06:41:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575237788] [2025-01-10 06:41:37,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:37,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:41:37,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:41:37,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:37,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:37,189 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:41:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575237788] [2025-01-10 06:41:37,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575237788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:37,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:37,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41079723] [2025-01-10 06:41:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:37,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:37,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:37,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:37,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 120 [2025-01-10 06:41:37,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 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:41:37,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:37,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 120 [2025-01-10 06:41:37,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:37,901 INFO L124 PetriNetUnfolderBase]: 7780/11984 cut-off events. [2025-01-10 06:41:37,901 INFO L125 PetriNetUnfolderBase]: For 10011/10011 co-relation queries the response was YES. [2025-01-10 06:41:37,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28827 conditions, 11984 events. 7780/11984 cut-off events. For 10011/10011 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 69000 event pairs, 6477 based on Foata normal form. 1/10774 useless extension candidates. Maximal degree in co-relation 28784. Up to 11312 conditions per place. [2025-01-10 06:41:37,959 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 75 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2025-01-10 06:41:37,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 479 flow [2025-01-10 06:41:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-01-10 06:41:37,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40208333333333335 [2025-01-10 06:41:37,960 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 327 flow. Second operand 4 states and 193 transitions. [2025-01-10 06:41:37,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 479 flow [2025-01-10 06:41:37,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 106 transitions, 470 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:41:37,965 INFO L231 Difference]: Finished difference. Result has 110 places, 105 transitions, 322 flow [2025-01-10 06:41:37,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=110, PETRI_TRANSITIONS=105} [2025-01-10 06:41:37,965 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 7 predicate places. [2025-01-10 06:41:37,965 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 322 flow [2025-01-10 06:41:37,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 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:41:37,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:37,966 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:41:37,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:41:37,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:37,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1870216282, now seen corresponding path program 1 times [2025-01-10 06:41:37,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:37,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273941294] [2025-01-10 06:41:37,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:37,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:41:37,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:41:37,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:41:38,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:38,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273941294] [2025-01-10 06:41:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273941294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:38,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:38,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586209370] [2025-01-10 06:41:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:38,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:38,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:38,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:38,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 120 [2025-01-10 06:41:38,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:41:38,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:38,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 120 [2025-01-10 06:41:38,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:38,653 INFO L124 PetriNetUnfolderBase]: 7780/11983 cut-off events. [2025-01-10 06:41:38,654 INFO L125 PetriNetUnfolderBase]: For 7741/7741 co-relation queries the response was YES. [2025-01-10 06:41:38,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27306 conditions, 11983 events. 7780/11983 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 69066 event pairs, 6477 based on Foata normal form. 1/10773 useless extension candidates. Maximal degree in co-relation 27258. Up to 11322 conditions per place. [2025-01-10 06:41:38,706 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 76 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2025-01-10 06:41:38,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 490 flow [2025-01-10 06:41:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-01-10 06:41:38,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41041666666666665 [2025-01-10 06:41:38,709 INFO L175 Difference]: Start difference. First operand has 110 places, 105 transitions, 322 flow. Second operand 4 states and 197 transitions. [2025-01-10 06:41:38,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 490 flow [2025-01-10 06:41:38,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:41:38,712 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 330 flow [2025-01-10 06:41:38,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2025-01-10 06:41:38,713 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 5 predicate places. [2025-01-10 06:41:38,713 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 330 flow [2025-01-10 06:41:38,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:41:38,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:38,713 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:38,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:41:38,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -528525542, now seen corresponding path program 1 times [2025-01-10 06:41:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909015180] [2025-01-10 06:41:38,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:41:38,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:41:38,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:38,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909015180] [2025-01-10 06:41:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909015180] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599826800] [2025-01-10 06:41:38,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:38,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:38,893 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:41:38,893 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:41:38,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:41:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:41:38,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:38,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:41:38,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:39,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:41:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:39,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599826800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:39,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:39,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:41:39,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132752573] [2025-01-10 06:41:39,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:41:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:39,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:41:39,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:41:39,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 120 [2025-01-10 06:41:39,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 330 flow. Second operand has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 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:41:39,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:39,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 120 [2025-01-10 06:41:39,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:39,986 INFO L124 PetriNetUnfolderBase]: 7779/11978 cut-off events. [2025-01-10 06:41:39,986 INFO L125 PetriNetUnfolderBase]: For 7744/7744 co-relation queries the response was YES. [2025-01-10 06:41:40,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27301 conditions, 11978 events. 7779/11978 cut-off events. For 7744/7744 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 68853 event pairs, 6477 based on Foata normal form. 1/10768 useless extension candidates. Maximal degree in co-relation 27249. Up to 11311 conditions per place. [2025-01-10 06:41:40,050 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 78 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2025-01-10 06:41:40,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 502 flow [2025-01-10 06:41:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:41:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:41:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 260 transitions. [2025-01-10 06:41:40,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-01-10 06:41:40,052 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 330 flow. Second operand 7 states and 260 transitions. [2025-01-10 06:41:40,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 502 flow [2025-01-10 06:41:40,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 488 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:41:40,057 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 339 flow [2025-01-10 06:41:40,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2025-01-10 06:41:40,058 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 11 predicate places. [2025-01-10 06:41:40,058 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 339 flow [2025-01-10 06:41:40,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 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:41:40,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:40,058 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 06:41:40,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:41:40,258 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,SelfDestructingSolverStorable23 [2025-01-10 06:41:40,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -782593927, now seen corresponding path program 2 times [2025-01-10 06:41:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859971858] [2025-01-10 06:41:40,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:41:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:40,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:41:40,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 36 statements. [2025-01-10 06:41:40,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:41:40,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 06:41:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859971858] [2025-01-10 06:41:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859971858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:40,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:40,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:41:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707721453] [2025-01-10 06:41:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:40,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:41:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:40,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:41:40,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:41:40,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 120 [2025-01-10 06:41:40,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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:41:40,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:40,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 120 [2025-01-10 06:41:40,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:40,956 INFO L124 PetriNetUnfolderBase]: 7779/11977 cut-off events. [2025-01-10 06:41:40,956 INFO L125 PetriNetUnfolderBase]: For 7774/7774 co-relation queries the response was YES. [2025-01-10 06:41:40,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27318 conditions, 11977 events. 7779/11977 cut-off events. For 7774/7774 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 68819 event pairs, 6477 based on Foata normal form. 1/10767 useless extension candidates. Maximal degree in co-relation 27264. Up to 11311 conditions per place. [2025-01-10 06:41:41,014 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 78 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2025-01-10 06:41:41,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 511 flow [2025-01-10 06:41:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:41:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:41:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-01-10 06:41:41,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 06:41:41,015 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 339 flow. Second operand 4 states and 180 transitions. [2025-01-10 06:41:41,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 511 flow [2025-01-10 06:41:41,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 496 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:41:41,019 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 349 flow [2025-01-10 06:41:41,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2025-01-10 06:41:41,020 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 8 predicate places. [2025-01-10 06:41:41,020 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 349 flow [2025-01-10 06:41:41,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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:41:41,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:41,020 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:41:41,021 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 59334623, now seen corresponding path program 2 times [2025-01-10 06:41:41,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914283941] [2025-01-10 06:41:41,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:41:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:41,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-10 06:41:41,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:41:41,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:41:41,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:41:41,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:41:41,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 06:41:41,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:41:41,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:41:41,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:41:41,070 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:41:41,070 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:41:41,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:41:41,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:41:41,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:41:41,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:41:41,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:41:41,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:41:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:41:41,073 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:41,073 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:41:41,073 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:41:41,124 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:41:41,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 159 transitions, 345 flow [2025-01-10 06:41:41,139 INFO L124 PetriNetUnfolderBase]: 37/228 cut-off events. [2025-01-10 06:41:41,139 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:41:41,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 37/228 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 874 event pairs, 1 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-01-10 06:41:41,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 159 transitions, 345 flow [2025-01-10 06:41:41,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 159 transitions, 345 flow [2025-01-10 06:41:41,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:41:41,142 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;@4af648e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:41:41,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:41:41,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:41:41,142 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:41:41,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:41:41,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:41,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:41:41,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:41:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash 750514256, now seen corresponding path program 1 times [2025-01-10 06:41:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835578480] [2025-01-10 06:41:41,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:41:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:41,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:41:41,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:41:41,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:41:41,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:41,175 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:41:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:41,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835578480] [2025-01-10 06:41:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835578480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:41,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:41:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634464030] [2025-01-10 06:41:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:41,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:41:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:41,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:41:41,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:41:41,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 159 [2025-01-10 06:41:41,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 159 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:41:41,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:41,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 159 [2025-01-10 06:41:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand