./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c00e63d-m [2025-02-06 18:39:57,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:39:57,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:39:57,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:39:57,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:39:57,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:39:57,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:39:57,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:39:57,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:39:57,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:39:57,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:39:57,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:39:57,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:39:57,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:39:57,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:39:57,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:39:57,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:39:57,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:39:57,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:39:57,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:39:57,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:39:57,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:39:57,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:39:57,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:39:57,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:39:57,973 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-02-06 18:39:58,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:39:58,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:39:58,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:39:58,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:39:58,255 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:39:58,258 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-02-06 18:39:59,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e27cc8e92/eb3aee80d7de46b792cf50e3d83481f4/FLAG5d3097142 [2025-02-06 18:39:59,959 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:39:59,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-06 18:39:59,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e27cc8e92/eb3aee80d7de46b792cf50e3d83481f4/FLAG5d3097142 [2025-02-06 18:40:00,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e27cc8e92/eb3aee80d7de46b792cf50e3d83481f4 [2025-02-06 18:40:00,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:40:00,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:40:00,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:40:00,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:40:00,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:40:00,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8d0687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00, skipping insertion in model container [2025-02-06 18:40:00,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:40:00,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:40:00,641 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:40:00,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:40:00,805 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:40:00,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00 WrapperNode [2025-02-06 18:40:00,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:40:00,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:40:00,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:40:00,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:40:00,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,861 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-02-06 18:40:00,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:40:00,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:40:00,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:40:00,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:40:00,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,897 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-02-06 18:40:00,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:40:00,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:40:00,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:40:00,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:40:00,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (1/1) ... [2025-02-06 18:40:00,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:40:00,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:00,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:40:00,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:40:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:40:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:40:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 18:40:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:40:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:40:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:40:00,969 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:40:01,180 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:40:01,182 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:40:01,436 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:40:01,437 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:40:01,572 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:40:01,573 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:40:01,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:40:01 BoogieIcfgContainer [2025-02-06 18:40:01,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:40:01,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:40:01,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:40:01,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:40:01,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:40:00" (1/3) ... [2025-02-06 18:40:01,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7478d8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:40:01, skipping insertion in model container [2025-02-06 18:40:01,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:40:00" (2/3) ... [2025-02-06 18:40:01,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7478d8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:40:01, skipping insertion in model container [2025-02-06 18:40:01,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:40:01" (3/3) ... [2025-02-06 18:40:01,581 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-02-06 18:40:01,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:40:01,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 72 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-02-06 18:40:01,593 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:40:01,644 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:40:01,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 175 flow [2025-02-06 18:40:01,704 INFO L124 PetriNetUnfolderBase]: 12/88 cut-off events. [2025-02-06 18:40:01,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:40:01,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 12/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-02-06 18:40:01,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 84 transitions, 175 flow [2025-02-06 18:40:01,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 83 transitions, 173 flow [2025-02-06 18:40:01,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:40:01,751 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;@48606f1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:40:01,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:40:01,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:40:01,755 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-06 18:40:01,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:40:01,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:01,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:40:01,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:01,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 622977340, now seen corresponding path program 1 times [2025-02-06 18:40:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:01,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326447829] [2025-02-06 18:40:01,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:01,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:40:01,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:40:01,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:01,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326447829] [2025-02-06 18:40:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326447829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:40:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742477412] [2025-02-06 18:40:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:02,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:02,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:02,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 84 [2025-02-06 18:40:02,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:02,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:02,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 84 [2025-02-06 18:40:02,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:02,369 INFO L124 PetriNetUnfolderBase]: 193/445 cut-off events. [2025-02-06 18:40:02,369 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:40:02,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 445 events. 193/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1729 event pairs, 150 based on Foata normal form. 19/368 useless extension candidates. Maximal degree in co-relation 770. Up to 367 conditions per place. [2025-02-06 18:40:02,374 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 42 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-02-06 18:40:02,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 245 flow [2025-02-06 18:40:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-02-06 18:40:02,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2025-02-06 18:40:02,386 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 173 flow. Second operand 3 states and 145 transitions. [2025-02-06 18:40:02,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 245 flow [2025-02-06 18:40:02,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:40:02,393 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 161 flow [2025-02-06 18:40:02,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-02-06 18:40:02,398 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2025-02-06 18:40:02,398 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 161 flow [2025-02-06 18:40:02,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:02,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:02,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:40:02,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 564644073, now seen corresponding path program 1 times [2025-02-06 18:40:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154275434] [2025-02-06 18:40:02,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:02,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:40:02,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:40:02,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:02,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:02,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154275434] [2025-02-06 18:40:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154275434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:40:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087639601] [2025-02-06 18:40:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:02,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:02,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:02,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:02,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-02-06 18:40:02,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:02,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:02,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-02-06 18:40:02,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:02,700 INFO L124 PetriNetUnfolderBase]: 194/462 cut-off events. [2025-02-06 18:40:02,700 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:40:02,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 462 events. 194/462 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1862 event pairs, 150 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 790. Up to 377 conditions per place. [2025-02-06 18:40:02,702 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 48 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-02-06 18:40:02,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 273 flow [2025-02-06 18:40:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-02-06 18:40:02,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5912698412698413 [2025-02-06 18:40:02,704 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 161 flow. Second operand 3 states and 149 transitions. [2025-02-06 18:40:02,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 273 flow [2025-02-06 18:40:02,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:02,705 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 178 flow [2025-02-06 18:40:02,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2025-02-06 18:40:02,706 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2025-02-06 18:40:02,706 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 178 flow [2025-02-06 18:40:02,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:02,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:02,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:02,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:40:02,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:02,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 101325349, now seen corresponding path program 1 times [2025-02-06 18:40:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708839453] [2025-02-06 18:40:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:02,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:40:02,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:40:02,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:02,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708839453] [2025-02-06 18:40:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708839453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:02,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567817245] [2025-02-06 18:40:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:02,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:02,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:02,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:02,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 84 [2025-02-06 18:40:02,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:02,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:02,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 84 [2025-02-06 18:40:02,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:02,980 INFO L124 PetriNetUnfolderBase]: 194/460 cut-off events. [2025-02-06 18:40:02,981 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:40:02,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 460 events. 194/460 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1852 event pairs, 150 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 790. Up to 380 conditions per place. [2025-02-06 18:40:02,985 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 51 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-02-06 18:40:02,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 80 transitions, 294 flow [2025-02-06 18:40:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-02-06 18:40:02,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2025-02-06 18:40:02,987 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 178 flow. Second operand 4 states and 173 transitions. [2025-02-06 18:40:02,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 80 transitions, 294 flow [2025-02-06 18:40:02,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 80 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:40:02,988 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 196 flow [2025-02-06 18:40:02,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2025-02-06 18:40:02,989 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-02-06 18:40:02,989 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 196 flow [2025-02-06 18:40:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:02,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:02,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:40:02,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:02,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash 211682037, now seen corresponding path program 1 times [2025-02-06 18:40:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699396247] [2025-02-06 18:40:02,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:03,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:40:03,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:40:03,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699396247] [2025-02-06 18:40:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699396247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655561474] [2025-02-06 18:40:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:03,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:03,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:03,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:03,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 84 [2025-02-06 18:40:03,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 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-02-06 18:40:03,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:03,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 84 [2025-02-06 18:40:03,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:03,306 INFO L124 PetriNetUnfolderBase]: 193/455 cut-off events. [2025-02-06 18:40:03,306 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 18:40:03,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 455 events. 193/455 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1725 event pairs, 150 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 823. Up to 367 conditions per place. [2025-02-06 18:40:03,308 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 46 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-02-06 18:40:03,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 291 flow [2025-02-06 18:40:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-02-06 18:40:03,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2025-02-06 18:40:03,310 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 196 flow. Second operand 4 states and 159 transitions. [2025-02-06 18:40:03,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 291 flow [2025-02-06 18:40:03,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 285 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:03,312 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 195 flow [2025-02-06 18:40:03,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2025-02-06 18:40:03,312 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2025-02-06 18:40:03,312 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 195 flow [2025-02-06 18:40:03,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 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-02-06 18:40:03,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:03,313 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:03,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:40:03,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:03,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1252339364, now seen corresponding path program 1 times [2025-02-06 18:40:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:03,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970996669] [2025-02-06 18:40:03,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:03,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:40:03,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:40:03,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:03,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970996669] [2025-02-06 18:40:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970996669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:40:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82033528] [2025-02-06 18:40:03,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:03,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:03,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:03,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:40:03,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:40:03,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:40:03,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:40:03,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:03,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:03,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:40:03,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:40:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:03,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:40:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82033528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:40:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 18:40:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421223235] [2025-02-06 18:40:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:03,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:40:03,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2025-02-06 18:40:03,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:03,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:03,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2025-02-06 18:40:03,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:03,775 INFO L124 PetriNetUnfolderBase]: 193/453 cut-off events. [2025-02-06 18:40:03,776 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 18:40:03,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 453 events. 193/453 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1715 event pairs, 150 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 818. Up to 370 conditions per place. [2025-02-06 18:40:03,779 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 45 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2025-02-06 18:40:03,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 289 flow [2025-02-06 18:40:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-02-06 18:40:03,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2025-02-06 18:40:03,781 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 195 flow. Second operand 4 states and 163 transitions. [2025-02-06 18:40:03,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 289 flow [2025-02-06 18:40:03,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 281 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:40:03,784 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 191 flow [2025-02-06 18:40:03,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2025-02-06 18:40:03,785 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-02-06 18:40:03,785 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 191 flow [2025-02-06 18:40:03,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:03,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:03,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:03,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:40:03,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:03,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash 167815002, now seen corresponding path program 1 times [2025-02-06 18:40:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73830581] [2025-02-06 18:40:03,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:04,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:40:04,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:40:04,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:04,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:04,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:04,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73830581] [2025-02-06 18:40:04,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73830581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:40:04,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782820381] [2025-02-06 18:40:04,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:04,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:04,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:04,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:40:04,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:40:04,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:40:04,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:40:04,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:04,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:04,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:40:04,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:40:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:04,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:40:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782820381] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:40:04,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:40:04,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 18:40:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169553492] [2025-02-06 18:40:04,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:40:04,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:40:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:04,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:40:04,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:40:04,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2025-02-06 18:40:04,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 191 flow. Second operand has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:04,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:04,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2025-02-06 18:40:04,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:04,497 INFO L124 PetriNetUnfolderBase]: 195/479 cut-off events. [2025-02-06 18:40:04,497 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 18:40:04,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 479 events. 195/479 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1939 event pairs, 150 based on Foata normal form. 3/390 useless extension candidates. Maximal degree in co-relation 863. Up to 375 conditions per place. [2025-02-06 18:40:04,499 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 53 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-02-06 18:40:04,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 349 flow [2025-02-06 18:40:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:40:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:40:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-02-06 18:40:04,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44387755102040816 [2025-02-06 18:40:04,500 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 191 flow. Second operand 7 states and 261 transitions. [2025-02-06 18:40:04,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 349 flow [2025-02-06 18:40:04,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 329 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:40:04,502 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 237 flow [2025-02-06 18:40:04,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-02-06 18:40:04,502 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-02-06 18:40:04,503 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 237 flow [2025-02-06 18:40:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:04,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:04,503 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] [2025-02-06 18:40:04,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:40:04,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:04,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:04,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -181353254, now seen corresponding path program 1 times [2025-02-06 18:40:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:04,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153132780] [2025-02-06 18:40:04,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:04,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 18:40:04,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 18:40:04,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:04,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:40:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153132780] [2025-02-06 18:40:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153132780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:40:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652247296] [2025-02-06 18:40:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:04,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:04,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:04,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:04,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 84 [2025-02-06 18:40:04,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:04,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:04,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 84 [2025-02-06 18:40:04,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:04,894 INFO L124 PetriNetUnfolderBase]: 164/428 cut-off events. [2025-02-06 18:40:04,894 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 18:40:04,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 428 events. 164/428 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1759 event pairs, 77 based on Foata normal form. 28/399 useless extension candidates. Maximal degree in co-relation 765. Up to 202 conditions per place. [2025-02-06 18:40:04,897 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 70 selfloop transitions, 5 changer transitions 4/105 dead transitions. [2025-02-06 18:40:04,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 441 flow [2025-02-06 18:40:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-02-06 18:40:04,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2025-02-06 18:40:04,900 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 237 flow. Second operand 3 states and 172 transitions. [2025-02-06 18:40:04,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 441 flow [2025-02-06 18:40:04,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 431 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:04,903 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 216 flow [2025-02-06 18:40:04,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2025-02-06 18:40:04,906 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2025-02-06 18:40:04,906 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 216 flow [2025-02-06 18:40:04,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:04,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:04,906 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:04,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:40:04,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:04,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 374477369, now seen corresponding path program 1 times [2025-02-06 18:40:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750815175] [2025-02-06 18:40:04,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:04,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 18:40:04,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 18:40:04,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:04,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750815175] [2025-02-06 18:40:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750815175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:40:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838679677] [2025-02-06 18:40:05,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:05,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:05,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:40:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:40:05,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 18:40:05,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 18:40:05,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:05,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:05,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:40:05,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:40:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:05,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:40:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838679677] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:40:05,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:40:05,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 18:40:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341889536] [2025-02-06 18:40:05,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:40:05,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:40:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:05,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:40:05,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:40:05,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 84 [2025-02-06 18:40:05,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 216 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:05,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:05,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 84 [2025-02-06 18:40:05,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:05,600 INFO L124 PetriNetUnfolderBase]: 132/338 cut-off events. [2025-02-06 18:40:05,601 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-06 18:40:05,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 338 events. 132/338 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1127 event pairs, 100 based on Foata normal form. 2/313 useless extension candidates. Maximal degree in co-relation 666. Up to 254 conditions per place. [2025-02-06 18:40:05,606 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 45 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2025-02-06 18:40:05,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 314 flow [2025-02-06 18:40:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:40:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:40:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2025-02-06 18:40:05,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37896825396825395 [2025-02-06 18:40:05,607 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 216 flow. Second operand 6 states and 191 transitions. [2025-02-06 18:40:05,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 314 flow [2025-02-06 18:40:05,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 72 transitions, 304 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:40:05,609 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 225 flow [2025-02-06 18:40:05,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2025-02-06 18:40:05,610 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-02-06 18:40:05,610 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 225 flow [2025-02-06 18:40:05,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:05,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:05,610 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 18:40:05,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:40:05,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:05,821 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:05,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1335480350, now seen corresponding path program 1 times [2025-02-06 18:40:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415623679] [2025-02-06 18:40:05,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:40:05,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:40:05,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:05,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:40:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415623679] [2025-02-06 18:40:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415623679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572980353] [2025-02-06 18:40:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:05,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2025-02-06 18:40:05,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:05,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:05,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2025-02-06 18:40:05,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:06,023 INFO L124 PetriNetUnfolderBase]: 132/337 cut-off events. [2025-02-06 18:40:06,023 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-06 18:40:06,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 337 events. 132/337 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1112 event pairs, 100 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 645. Up to 262 conditions per place. [2025-02-06 18:40:06,024 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 42 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-02-06 18:40:06,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 70 transitions, 325 flow [2025-02-06 18:40:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-02-06 18:40:06,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2025-02-06 18:40:06,026 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 225 flow. Second operand 4 states and 158 transitions. [2025-02-06 18:40:06,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 70 transitions, 325 flow [2025-02-06 18:40:06,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 70 transitions, 314 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:40:06,027 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 238 flow [2025-02-06 18:40:06,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-02-06 18:40:06,028 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-02-06 18:40:06,028 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 238 flow [2025-02-06 18:40:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:06,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:06,028 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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-02-06 18:40:06,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:40:06,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1801866356, now seen corresponding path program 2 times [2025-02-06 18:40:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500254564] [2025-02-06 18:40:06,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:40:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:06,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 18:40:06,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:40:06,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:40:06,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:40:06,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:40:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:40:06,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:40:06,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:06,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:40:06,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:40:06,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:40:06,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 18:40:06,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-06 18:40:06,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-06 18:40:06,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-06 18:40:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-06 18:40:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:40:06,106 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:06,108 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:40:06,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:40:06,139 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:40:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 125 transitions, 266 flow [2025-02-06 18:40:06,151 INFO L124 PetriNetUnfolderBase]: 23/152 cut-off events. [2025-02-06 18:40:06,151 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:40:06,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 152 events. 23/152 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 517 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-02-06 18:40:06,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 125 transitions, 266 flow [2025-02-06 18:40:06,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 125 transitions, 266 flow [2025-02-06 18:40:06,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:40:06,154 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;@48606f1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:40:06,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:40:06,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:40:06,155 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-06 18:40:06,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:40:06,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:06,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:40:06,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 25942044, now seen corresponding path program 1 times [2025-02-06 18:40:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907683892] [2025-02-06 18:40:06,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:06,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:40:06,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:40:06,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:06,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907683892] [2025-02-06 18:40:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907683892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:06,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:06,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:40:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248504238] [2025-02-06 18:40:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:06,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:06,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:06,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2025-02-06 18:40:06,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 125 transitions, 266 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-02-06 18:40:06,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:06,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2025-02-06 18:40:06,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:07,464 INFO L124 PetriNetUnfolderBase]: 11368/17837 cut-off events. [2025-02-06 18:40:07,465 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-02-06 18:40:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34413 conditions, 17837 events. 11368/17837 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 112785 event pairs, 9482 based on Foata normal form. 785/15257 useless extension candidates. Maximal degree in co-relation 27207. Up to 16432 conditions per place. [2025-02-06 18:40:07,588 INFO L140 encePairwiseOnDemand]: 112/125 looper letters, 74 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-02-06 18:40:07,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 114 transitions, 396 flow [2025-02-06 18:40:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-02-06 18:40:07,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536 [2025-02-06 18:40:07,590 INFO L175 Difference]: Start difference. First operand has 108 places, 125 transitions, 266 flow. Second operand 3 states and 201 transitions. [2025-02-06 18:40:07,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 114 transitions, 396 flow [2025-02-06 18:40:07,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 114 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:40:07,593 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 248 flow [2025-02-06 18:40:07,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2025-02-06 18:40:07,594 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -2 predicate places. [2025-02-06 18:40:07,594 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 248 flow [2025-02-06 18:40:07,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-02-06 18:40:07,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:07,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:07,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:40:07,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:07,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:07,595 INFO L85 PathProgramCache]: Analyzing trace with hash -254162202, now seen corresponding path program 1 times [2025-02-06 18:40:07,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:07,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349322424] [2025-02-06 18:40:07,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:40:07,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:40:07,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:07,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349322424] [2025-02-06 18:40:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349322424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:07,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:40:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363673169] [2025-02-06 18:40:07,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:07,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:07,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:07,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:07,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 125 [2025-02-06 18:40:07,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:07,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:07,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 125 [2025-02-06 18:40:07,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:08,978 INFO L124 PetriNetUnfolderBase]: 11369/17854 cut-off events. [2025-02-06 18:40:08,978 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-02-06 18:40:09,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34441 conditions, 17854 events. 11369/17854 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 112943 event pairs, 9482 based on Foata normal form. 2/14491 useless extension candidates. Maximal degree in co-relation 34379. Up to 16442 conditions per place. [2025-02-06 18:40:09,060 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 80 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-02-06 18:40:09,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 118 transitions, 424 flow [2025-02-06 18:40:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-02-06 18:40:09,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5386666666666666 [2025-02-06 18:40:09,061 INFO L175 Difference]: Start difference. First operand has 106 places, 114 transitions, 248 flow. Second operand 3 states and 202 transitions. [2025-02-06 18:40:09,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 118 transitions, 424 flow [2025-02-06 18:40:09,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 118 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:09,064 INFO L231 Difference]: Finished difference. Result has 107 places, 116 transitions, 265 flow [2025-02-06 18:40:09,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=107, PETRI_TRANSITIONS=116} [2025-02-06 18:40:09,064 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2025-02-06 18:40:09,064 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 265 flow [2025-02-06 18:40:09,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:09,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:09,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:40:09,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 142314722, now seen corresponding path program 1 times [2025-02-06 18:40:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969572147] [2025-02-06 18:40:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:09,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:40:09,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:40:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969572147] [2025-02-06 18:40:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969572147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853837766] [2025-02-06 18:40:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:09,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:09,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:09,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:09,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 125 [2025-02-06 18:40:09,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 116 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:09,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:09,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 125 [2025-02-06 18:40:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:10,100 INFO L124 PetriNetUnfolderBase]: 11369/17852 cut-off events. [2025-02-06 18:40:10,101 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-02-06 18:40:10,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34450 conditions, 17852 events. 11369/17852 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 112955 event pairs, 9482 based on Foata normal form. 2/14491 useless extension candidates. Maximal degree in co-relation 34379. Up to 16445 conditions per place. [2025-02-06 18:40:10,150 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 83 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2025-02-06 18:40:10,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 445 flow [2025-02-06 18:40:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-02-06 18:40:10,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.466 [2025-02-06 18:40:10,152 INFO L175 Difference]: Start difference. First operand has 107 places, 116 transitions, 265 flow. Second operand 4 states and 233 transitions. [2025-02-06 18:40:10,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 445 flow [2025-02-06 18:40:10,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 119 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:40:10,154 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 283 flow [2025-02-06 18:40:10,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2025-02-06 18:40:10,155 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 3 predicate places. [2025-02-06 18:40:10,155 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 283 flow [2025-02-06 18:40:10,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:10,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:10,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:10,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:40:10,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:10,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:10,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1555542620, now seen corresponding path program 1 times [2025-02-06 18:40:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361530452] [2025-02-06 18:40:10,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:10,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:40:10,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:40:10,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:10,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:10,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361530452] [2025-02-06 18:40:10,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361530452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:10,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:10,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627752194] [2025-02-06 18:40:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:10,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:10,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:10,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:10,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:10,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 125 [2025-02-06 18:40:10,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:10,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:10,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 125 [2025-02-06 18:40:10,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:11,221 INFO L124 PetriNetUnfolderBase]: 11368/17847 cut-off events. [2025-02-06 18:40:11,221 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-02-06 18:40:11,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34447 conditions, 17847 events. 11368/17847 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 112817 event pairs, 9482 based on Foata normal form. 1/14487 useless extension candidates. Maximal degree in co-relation 34412. Up to 16432 conditions per place. [2025-02-06 18:40:11,279 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 78 selfloop transitions, 4 changer transitions 0/117 dead transitions. [2025-02-06 18:40:11,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 117 transitions, 442 flow [2025-02-06 18:40:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-02-06 18:40:11,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.438 [2025-02-06 18:40:11,280 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 283 flow. Second operand 4 states and 219 transitions. [2025-02-06 18:40:11,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 117 transitions, 442 flow [2025-02-06 18:40:11,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 117 transitions, 436 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:11,283 INFO L231 Difference]: Finished difference. Result has 113 places, 116 transitions, 282 flow [2025-02-06 18:40:11,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=113, PETRI_TRANSITIONS=116} [2025-02-06 18:40:11,283 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 5 predicate places. [2025-02-06 18:40:11,283 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 116 transitions, 282 flow [2025-02-06 18:40:11,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:11,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:11,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:11,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:40:11,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:11,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1696388737, now seen corresponding path program 1 times [2025-02-06 18:40:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:11,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926247405] [2025-02-06 18:40:11,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:11,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:40:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:40:11,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:11,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:11,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:11,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926247405] [2025-02-06 18:40:11,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926247405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:40:11,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610874429] [2025-02-06 18:40:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:11,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:11,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:11,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:40:11,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:40:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:40:11,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:40:11,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:11,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:11,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:40:11,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:40:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:11,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:40:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610874429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:40:11,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 18:40:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318316461] [2025-02-06 18:40:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:11,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:11,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:11,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:40:11,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 125 [2025-02-06 18:40:11,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:11,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:11,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 125 [2025-02-06 18:40:11,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:12,905 INFO L124 PetriNetUnfolderBase]: 11368/17845 cut-off events. [2025-02-06 18:40:12,906 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-02-06 18:40:12,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34450 conditions, 17845 events. 11368/17845 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 112765 event pairs, 9482 based on Foata normal form. 2/14486 useless extension candidates. Maximal degree in co-relation 34407. Up to 16435 conditions per place. [2025-02-06 18:40:13,009 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 77 selfloop transitions, 6 changer transitions 0/114 dead transitions. [2025-02-06 18:40:13,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 440 flow [2025-02-06 18:40:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-02-06 18:40:13,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.446 [2025-02-06 18:40:13,012 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 282 flow. Second operand 4 states and 223 transitions. [2025-02-06 18:40:13,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 440 flow [2025-02-06 18:40:13,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 114 transitions, 432 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:40:13,015 INFO L231 Difference]: Finished difference. Result has 111 places, 114 transitions, 278 flow [2025-02-06 18:40:13,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=111, PETRI_TRANSITIONS=114} [2025-02-06 18:40:13,016 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 3 predicate places. [2025-02-06 18:40:13,016 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 114 transitions, 278 flow [2025-02-06 18:40:13,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:13,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:13,016 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:13,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:40:13,221 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,SelfDestructingSolverStorable14 [2025-02-06 18:40:13,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1048443802, now seen corresponding path program 1 times [2025-02-06 18:40:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374476763] [2025-02-06 18:40:13,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:13,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:40:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:40:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374476763] [2025-02-06 18:40:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374476763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:40:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179291988] [2025-02-06 18:40:13,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:13,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:40:13,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:40:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:40:13,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:40:13,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:13,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:13,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:40:13,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:40:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:13,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:40:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179291988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:40:13,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:40:13,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 18:40:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903829672] [2025-02-06 18:40:13,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:40:13,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:40:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:13,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:40:13,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:40:13,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 125 [2025-02-06 18:40:13,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 278 flow. Second operand has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:13,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:13,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 125 [2025-02-06 18:40:13,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:14,399 INFO L124 PetriNetUnfolderBase]: 11370/17871 cut-off events. [2025-02-06 18:40:14,400 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2025-02-06 18:40:14,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34495 conditions, 17871 events. 11370/17871 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 113104 event pairs, 9482 based on Foata normal form. 3/14513 useless extension candidates. Maximal degree in co-relation 34452. Up to 16440 conditions per place. [2025-02-06 18:40:14,463 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 85 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-02-06 18:40:14,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 125 transitions, 500 flow [2025-02-06 18:40:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:40:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:40:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 342 transitions. [2025-02-06 18:40:14,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39085714285714285 [2025-02-06 18:40:14,464 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 278 flow. Second operand 7 states and 342 transitions. [2025-02-06 18:40:14,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 125 transitions, 500 flow [2025-02-06 18:40:14,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 125 transitions, 480 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:40:14,466 INFO L231 Difference]: Finished difference. Result has 118 places, 119 transitions, 324 flow [2025-02-06 18:40:14,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=118, PETRI_TRANSITIONS=119} [2025-02-06 18:40:14,467 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 10 predicate places. [2025-02-06 18:40:14,467 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 119 transitions, 324 flow [2025-02-06 18:40:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:14,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:14,468 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] [2025-02-06 18:40:14,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:40:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 18:40:14,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1185385887, now seen corresponding path program 1 times [2025-02-06 18:40:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801238250] [2025-02-06 18:40:14,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:14,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 18:40:14,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 18:40:14,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:14,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:40:14,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:14,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801238250] [2025-02-06 18:40:14,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801238250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:14,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:40:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124438796] [2025-02-06 18:40:14,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:14,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:14,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:14,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:14,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2025-02-06 18:40:14,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 119 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:14,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:14,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2025-02-06 18:40:14,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:15,795 INFO L124 PetriNetUnfolderBase]: 13071/20563 cut-off events. [2025-02-06 18:40:15,795 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-02-06 18:40:15,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39470 conditions, 20563 events. 13071/20563 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 138853 event pairs, 5467 based on Foata normal form. 83/17078 useless extension candidates. Maximal degree in co-relation 39425. Up to 13742 conditions per place. [2025-02-06 18:40:15,881 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 142 selfloop transitions, 6 changer transitions 1/184 dead transitions. [2025-02-06 18:40:15,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 184 transitions, 758 flow [2025-02-06 18:40:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-02-06 18:40:15,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-02-06 18:40:15,883 INFO L175 Difference]: Start difference. First operand has 118 places, 119 transitions, 324 flow. Second operand 3 states and 265 transitions. [2025-02-06 18:40:15,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 184 transitions, 758 flow [2025-02-06 18:40:15,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 184 transitions, 748 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:15,886 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 346 flow [2025-02-06 18:40:15,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-02-06 18:40:15,887 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 11 predicate places. [2025-02-06 18:40:15,887 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 346 flow [2025-02-06 18:40:15,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:15,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:15,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:15,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:40:15,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:15,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1439821469, now seen corresponding path program 1 times [2025-02-06 18:40:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:15,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071372072] [2025-02-06 18:40:15,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:15,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:40:15,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:40:15,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:15,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:40:15,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:15,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071372072] [2025-02-06 18:40:15,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071372072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:15,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:15,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742851204] [2025-02-06 18:40:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:15,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:15,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:15,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:15,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:15,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2025-02-06 18:40:15,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:15,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:15,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2025-02-06 18:40:15,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:17,258 INFO L124 PetriNetUnfolderBase]: 11400/18028 cut-off events. [2025-02-06 18:40:17,259 INFO L125 PetriNetUnfolderBase]: For 3869/3869 co-relation queries the response was YES. [2025-02-06 18:40:17,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37051 conditions, 18028 events. 11400/18028 cut-off events. For 3869/3869 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 121254 event pairs, 4686 based on Foata normal form. 733/16255 useless extension candidates. Maximal degree in co-relation 37006. Up to 11284 conditions per place. [2025-02-06 18:40:17,396 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 195 selfloop transitions, 7 changer transitions 2/239 dead transitions. [2025-02-06 18:40:17,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 239 transitions, 994 flow [2025-02-06 18:40:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2025-02-06 18:40:17,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.708 [2025-02-06 18:40:17,398 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 346 flow. Second operand 4 states and 354 transitions. [2025-02-06 18:40:17,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 239 transitions, 994 flow [2025-02-06 18:40:17,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 239 transitions, 988 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:40:17,406 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 346 flow [2025-02-06 18:40:17,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2025-02-06 18:40:17,407 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 11 predicate places. [2025-02-06 18:40:17,407 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 346 flow [2025-02-06 18:40:17,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:17,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:17,408 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:17,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:40:17,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:17,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1684792044, now seen corresponding path program 1 times [2025-02-06 18:40:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858888043] [2025-02-06 18:40:17,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:17,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:40:17,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:40:17,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:40:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858888043] [2025-02-06 18:40:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858888043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:40:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461538622] [2025-02-06 18:40:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:17,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:17,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:17,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2025-02-06 18:40:17,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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-02-06 18:40:17,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:17,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2025-02-06 18:40:17,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:18,517 INFO L124 PetriNetUnfolderBase]: 9804/15383 cut-off events. [2025-02-06 18:40:18,518 INFO L125 PetriNetUnfolderBase]: For 1394/1394 co-relation queries the response was YES. [2025-02-06 18:40:18,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32526 conditions, 15383 events. 9804/15383 cut-off events. For 1394/1394 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 93904 event pairs, 6557 based on Foata normal form. 1/13886 useless extension candidates. Maximal degree in co-relation 32481. Up to 11603 conditions per place. [2025-02-06 18:40:18,578 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 128 selfloop transitions, 7 changer transitions 8/176 dead transitions. [2025-02-06 18:40:18,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 176 transitions, 740 flow [2025-02-06 18:40:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:40:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:40:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-02-06 18:40:18,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-02-06 18:40:18,580 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 346 flow. Second operand 3 states and 252 transitions. [2025-02-06 18:40:18,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 176 transitions, 740 flow [2025-02-06 18:40:18,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 176 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:40:18,591 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 327 flow [2025-02-06 18:40:18,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2025-02-06 18:40:18,592 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 10 predicate places. [2025-02-06 18:40:18,592 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 327 flow [2025-02-06 18:40:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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-02-06 18:40:18,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:18,592 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 18:40:18,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:40:18,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:18,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2020083326, now seen corresponding path program 1 times [2025-02-06 18:40:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178734782] [2025-02-06 18:40:18,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:18,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:40:18,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:40:18,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:40:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178734782] [2025-02-06 18:40:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178734782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:18,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:18,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:40:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020817109] [2025-02-06 18:40:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:18,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:40:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:18,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:40:18,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:40:18,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 125 [2025-02-06 18:40:18,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:18,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:18,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 125 [2025-02-06 18:40:18,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:19,506 INFO L124 PetriNetUnfolderBase]: 7764/12240 cut-off events. [2025-02-06 18:40:19,506 INFO L125 PetriNetUnfolderBase]: For 9957/9957 co-relation queries the response was YES. [2025-02-06 18:40:19,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29020 conditions, 12240 events. 7764/12240 cut-off events. For 9957/9957 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 73579 event pairs, 6451 based on Foata normal form. 1/11009 useless extension candidates. Maximal degree in co-relation 28975. Up to 11281 conditions per place. [2025-02-06 18:40:19,560 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 76 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2025-02-06 18:40:19,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 495 flow [2025-02-06 18:40:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:40:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:40:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-02-06 18:40:19,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.434 [2025-02-06 18:40:19,562 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 327 flow. Second operand 4 states and 217 transitions. [2025-02-06 18:40:19,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 495 flow [2025-02-06 18:40:19,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 110 transitions, 484 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:40:19,566 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 340 flow [2025-02-06 18:40:19,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-02-06 18:40:19,567 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 5 predicate places. [2025-02-06 18:40:19,567 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 340 flow [2025-02-06 18:40:19,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:19,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:19,567 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:19,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:40:19,567 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:19,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash 117535252, now seen corresponding path program 1 times [2025-02-06 18:40:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:19,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158980719] [2025-02-06 18:40:19,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:19,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:40:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:40:19,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:19,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:19,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158980719] [2025-02-06 18:40:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158980719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:40:19,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114340765] [2025-02-06 18:40:19,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:19,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:40:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:40:19,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:40:19,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:40:19,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:40:19,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:40:19,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:19,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:19,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:40:19,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:40:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:19,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:40:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:40:19,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114340765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:40:19,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:40:19,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 18:40:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602139165] [2025-02-06 18:40:19,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:40:19,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:40:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:19,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:40:19,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:40:19,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 125 [2025-02-06 18:40:19,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 340 flow. Second operand has 13 states, 13 states have (on average 32.38461538461539) internal successors, (421), 13 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:19,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:19,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 125 [2025-02-06 18:40:19,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:40:20,792 INFO L124 PetriNetUnfolderBase]: 7763/12234 cut-off events. [2025-02-06 18:40:20,793 INFO L125 PetriNetUnfolderBase]: For 7695/7695 co-relation queries the response was YES. [2025-02-06 18:40:20,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27492 conditions, 12234 events. 7763/12234 cut-off events. For 7695/7695 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 73383 event pairs, 6451 based on Foata normal form. 2/11004 useless extension candidates. Maximal degree in co-relation 27444. Up to 11270 conditions per place. [2025-02-06 18:40:20,834 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 76 selfloop transitions, 9 changer transitions 0/111 dead transitions. [2025-02-06 18:40:20,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 498 flow [2025-02-06 18:40:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:40:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:40:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-02-06 18:40:20,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34933333333333333 [2025-02-06 18:40:20,835 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 340 flow. Second operand 6 states and 262 transitions. [2025-02-06 18:40:20,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 498 flow [2025-02-06 18:40:20,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 111 transitions, 478 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 18:40:20,838 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 337 flow [2025-02-06 18:40:20,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2025-02-06 18:40:20,839 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 7 predicate places. [2025-02-06 18:40:20,839 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 337 flow [2025-02-06 18:40:20,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.38461538461539) internal successors, (421), 13 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:20,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:20,839 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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-02-06 18:40:20,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:40:21,040 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,SelfDestructingSolverStorable20 [2025-02-06 18:40:21,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1229331161, now seen corresponding path program 2 times [2025-02-06 18:40:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286200270] [2025-02-06 18:40:21,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:40:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:21,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 18:40:21,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 18:40:21,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:40:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:40:21,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:40:21,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 18:40:21,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 18:40:21,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:21,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:40:21,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:40:21,087 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:40:21,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 18:40:21,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-06 18:40:21,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-06 18:40:21,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:40:21,088 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:40:21,089 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:40:21,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:40:21,125 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:40:21,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 166 transitions, 359 flow [2025-02-06 18:40:21,142 INFO L124 PetriNetUnfolderBase]: 37/235 cut-off events. [2025-02-06 18:40:21,142 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 18:40:21,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 235 events. 37/235 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 927 event pairs, 1 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 160. Up to 12 conditions per place. [2025-02-06 18:40:21,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 166 transitions, 359 flow [2025-02-06 18:40:21,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 166 transitions, 359 flow [2025-02-06 18:40:21,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:40:21,146 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;@48606f1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:40:21,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:40:21,147 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:40:21,147 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-06 18:40:21,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:40:21,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:40:21,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:40:21,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:40:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:40:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash 641828444, now seen corresponding path program 1 times [2025-02-06 18:40:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:40:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-02-06 18:40:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:40:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:40:21,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:40:21,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:40:21,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:40:21,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:40:21,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-02-06 18:40:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:40:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-02-06 18:40:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166870798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:40:21,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:40:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:40:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52476267] [2025-02-06 18:40:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:40:21,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:40:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:40:21,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:40:21,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:40:21,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 166 [2025-02-06 18:40:21,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 166 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:40:21,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:40:21,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 166 [2025-02-06 18:40:21,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand