./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:28:41,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:28:41,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:28:41,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:28:41,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:28:41,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:28:41,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:28:41,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:28:41,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:28:41,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:28:41,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:28:41,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:28:41,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:28:41,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:28:41,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:28:41,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:28:41,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:28:41,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:41,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:28:41,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:28:41,951 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/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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-03-04 15:28:42,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:28:42,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:28:42,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:28:42,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:28:42,179 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:28:42,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-03-04 15:28:43,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/195610a14/3770e924faf14c86b7eb4057a3ac88d0/FLAG5cbe1e07c [2025-03-04 15:28:43,612 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:28:43,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-03-04 15:28:43,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/195610a14/3770e924faf14c86b7eb4057a3ac88d0/FLAG5cbe1e07c [2025-03-04 15:28:43,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/195610a14/3770e924faf14c86b7eb4057a3ac88d0 [2025-03-04 15:28:43,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:28:43,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:28:43,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:43,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:28:43,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:28:43,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:43" (1/1) ... [2025-03-04 15:28:43,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d60a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:43, skipping insertion in model container [2025-03-04 15:28:43,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:43" (1/1) ... [2025-03-04 15:28:43,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:28:44,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:44,149 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:28:44,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:44,182 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:28:44,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44 WrapperNode [2025-03-04 15:28:44,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:44,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:44,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:28:44,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:28:44,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,222 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 224 [2025-03-04 15:28:44,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:44,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:28:44,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:28:44,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:28:44,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,254 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:28:44,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:28:44,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:28:44,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:28:44,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:28:44,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (1/1) ... [2025-03-04 15:28:44,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:44,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:44,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:28:44,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:28:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:28:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:28:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:28:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:28:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:28:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:28:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:28:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:28:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:28:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:28:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:28:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:28:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:28:44,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:28:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:28:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:28:44,331 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:28:44,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:28:44,410 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:28:44,744 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:28:44,745 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:28:44,914 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:28:44,914 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:28:44,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:44 BoogieIcfgContainer [2025-03-04 15:28:44,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:28:44,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:28:44,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:28:44,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:28:44,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:28:43" (1/3) ... [2025-03-04 15:28:44,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff03427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:44, skipping insertion in model container [2025-03-04 15:28:44,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:44" (2/3) ... [2025-03-04 15:28:44,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff03427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:44, skipping insertion in model container [2025-03-04 15:28:44,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:44" (3/3) ... [2025-03-04 15:28:44,923 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-03-04 15:28:44,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:28:44,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 90 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-04 15:28:44,938 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:28:45,009 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:28:45,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 219 flow [2025-03-04 15:28:45,082 INFO L124 PetriNetUnfolderBase]: 10/96 cut-off events. [2025-03-04 15:28:45,084 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:28:45,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 10/96 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 362 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2025-03-04 15:28:45,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 219 flow [2025-03-04 15:28:45,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 203 flow [2025-03-04 15:28:45,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:28:45,134 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;@131509a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:28:45,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-04 15:28:45,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:28:45,140 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:28:45,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:28:45,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:45,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:28:45,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:45,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 649382, now seen corresponding path program 1 times [2025-03-04 15:28:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:45,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191143495] [2025-03-04 15:28:45,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:45,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:45,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:28:45,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:28:45,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:45,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191143495] [2025-03-04 15:28:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191143495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287299649] [2025-03-04 15:28:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:45,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:45,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:45,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 99 [2025-03-04 15:28:45,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:28:45,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:45,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 99 [2025-03-04 15:28:45,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:46,455 INFO L124 PetriNetUnfolderBase]: 6406/12241 cut-off events. [2025-03-04 15:28:46,456 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-03-04 15:28:46,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21092 conditions, 12241 events. 6406/12241 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 103535 event pairs, 4494 based on Foata normal form. 1/10010 useless extension candidates. Maximal degree in co-relation 20069. Up to 8551 conditions per place. [2025-03-04 15:28:46,557 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 40 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-03-04 15:28:46,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 289 flow [2025-03-04 15:28:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-03-04 15:28:46,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-04 15:28:46,570 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 203 flow. Second operand 4 states and 253 transitions. [2025-03-04 15:28:46,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 289 flow [2025-03-04 15:28:46,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 280 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:46,581 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 200 flow [2025-03-04 15:28:46,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2025-03-04 15:28:46,588 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -3 predicate places. [2025-03-04 15:28:46,588 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 200 flow [2025-03-04 15:28:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:28:46,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:46,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:28:46,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:28:46,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:46,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 20131377, now seen corresponding path program 1 times [2025-03-04 15:28:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3632539] [2025-03-04 15:28:46,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:46,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:28:46,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:28:46,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:46,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3632539] [2025-03-04 15:28:46,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3632539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:46,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:46,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782131617] [2025-03-04 15:28:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:46,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:46,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:46,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:46,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 99 [2025-03-04 15:28:46,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:28:46,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:46,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 99 [2025-03-04 15:28:46,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:47,389 INFO L124 PetriNetUnfolderBase]: 6407/12245 cut-off events. [2025-03-04 15:28:47,390 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-04 15:28:47,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20982 conditions, 12245 events. 6407/12245 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 103544 event pairs, 4494 based on Foata normal form. 1/10014 useless extension candidates. Maximal degree in co-relation 20954. Up to 8556 conditions per place. [2025-03-04 15:28:47,486 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 43 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-03-04 15:28:47,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 306 flow [2025-03-04 15:28:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2025-03-04 15:28:47,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-04 15:28:47,488 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 200 flow. Second operand 4 states and 256 transitions. [2025-03-04 15:28:47,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 306 flow [2025-03-04 15:28:47,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:47,493 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 219 flow [2025-03-04 15:28:47,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2025-03-04 15:28:47,494 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -1 predicate places. [2025-03-04 15:28:47,494 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 219 flow [2025-03-04 15:28:47,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:28:47,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:47,495 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:28:47,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:28:47,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:47,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1560921170, now seen corresponding path program 1 times [2025-03-04 15:28:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345644352] [2025-03-04 15:28:47,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:47,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:47,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:47,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:47,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345644352] [2025-03-04 15:28:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345644352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868252647] [2025-03-04 15:28:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:47,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:47,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:28:47,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:47,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:47,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:47,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:47,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:47,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:47,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868252647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:47,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:47,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:28:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803174178] [2025-03-04 15:28:47,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:47,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:28:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:47,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:28:47,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:28:47,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 99 [2025-03-04 15:28:47,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 219 flow. Second operand has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 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-03-04 15:28:47,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:47,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 99 [2025-03-04 15:28:47,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:48,593 INFO L124 PetriNetUnfolderBase]: 6410/12257 cut-off events. [2025-03-04 15:28:48,594 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-03-04 15:28:48,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21018 conditions, 12257 events. 6410/12257 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 103732 event pairs, 4494 based on Foata normal form. 0/10022 useless extension candidates. Maximal degree in co-relation 20961. Up to 8559 conditions per place. [2025-03-04 15:28:48,666 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 43 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2025-03-04 15:28:48,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 367 flow [2025-03-04 15:28:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:28:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:28:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 579 transitions. [2025-03-04 15:28:48,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5848484848484848 [2025-03-04 15:28:48,671 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 219 flow. Second operand 10 states and 579 transitions. [2025-03-04 15:28:48,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 367 flow [2025-03-04 15:28:48,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 105 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:48,675 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 296 flow [2025-03-04 15:28:48,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2025-03-04 15:28:48,677 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2025-03-04 15:28:48,677 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 296 flow [2025-03-04 15:28:48,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 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-03-04 15:28:48,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:48,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:48,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:48,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:48,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1371160011, now seen corresponding path program 1 times [2025-03-04 15:28:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395144824] [2025-03-04 15:28:48,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:48,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:48,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:48,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:48,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395144824] [2025-03-04 15:28:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395144824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662511349] [2025-03-04 15:28:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:48,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:48,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:48,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 99 [2025-03-04 15:28:48,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-03-04 15:28:48,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:48,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 99 [2025-03-04 15:28:48,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:49,970 INFO L124 PetriNetUnfolderBase]: 11991/21193 cut-off events. [2025-03-04 15:28:49,970 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-04 15:28:50,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37629 conditions, 21193 events. 11991/21193 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 181189 event pairs, 4037 based on Foata normal form. 532/18008 useless extension candidates. Maximal degree in co-relation 37593. Up to 7799 conditions per place. [2025-03-04 15:28:50,093 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 113 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-03-04 15:28:50,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 162 transitions, 652 flow [2025-03-04 15:28:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2025-03-04 15:28:50,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76010101010101 [2025-03-04 15:28:50,095 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 296 flow. Second operand 4 states and 301 transitions. [2025-03-04 15:28:50,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 162 transitions, 652 flow [2025-03-04 15:28:50,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 162 transitions, 622 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:50,098 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 300 flow [2025-03-04 15:28:50,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-03-04 15:28:50,098 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2025-03-04 15:28:50,098 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 300 flow [2025-03-04 15:28:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-03-04 15:28:50,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:50,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:50,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:28:50,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 443713241, now seen corresponding path program 1 times [2025-03-04 15:28:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592516253] [2025-03-04 15:28:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:50,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:28:50,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:28:50,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:50,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592516253] [2025-03-04 15:28:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592516253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:50,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533330732] [2025-03-04 15:28:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:50,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:50,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:50,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:28:50,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 99 [2025-03-04 15:28:50,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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-03-04 15:28:50,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:50,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 99 [2025-03-04 15:28:50,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:51,223 INFO L124 PetriNetUnfolderBase]: 9766/18849 cut-off events. [2025-03-04 15:28:51,223 INFO L125 PetriNetUnfolderBase]: For 3267/3707 co-relation queries the response was YES. [2025-03-04 15:28:51,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34479 conditions, 18849 events. 9766/18849 cut-off events. For 3267/3707 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 170388 event pairs, 6511 based on Foata normal form. 487/16407 useless extension candidates. Maximal degree in co-relation 34445. Up to 10317 conditions per place. [2025-03-04 15:28:51,322 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 111 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-03-04 15:28:51,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 166 transitions, 659 flow [2025-03-04 15:28:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 376 transitions. [2025-03-04 15:28:51,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7595959595959596 [2025-03-04 15:28:51,324 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 300 flow. Second operand 5 states and 376 transitions. [2025-03-04 15:28:51,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 166 transitions, 659 flow [2025-03-04 15:28:51,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 166 transitions, 659 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:28:51,349 INFO L231 Difference]: Finished difference. Result has 112 places, 109 transitions, 325 flow [2025-03-04 15:28:51,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=112, PETRI_TRANSITIONS=109} [2025-03-04 15:28:51,350 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 18 predicate places. [2025-03-04 15:28:51,350 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 325 flow [2025-03-04 15:28:51,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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-03-04 15:28:51,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:51,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:51,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:28:51,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:51,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 860695947, now seen corresponding path program 1 times [2025-03-04 15:28:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753037011] [2025-03-04 15:28:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753037011] [2025-03-04 15:28:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753037011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520200130] [2025-03-04 15:28:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:51,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:51,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:51,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:51,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 99 [2025-03-04 15:28:51,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-03-04 15:28:51,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:51,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 99 [2025-03-04 15:28:51,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:53,118 INFO L124 PetriNetUnfolderBase]: 17159/31581 cut-off events. [2025-03-04 15:28:53,118 INFO L125 PetriNetUnfolderBase]: For 9587/10189 co-relation queries the response was YES. [2025-03-04 15:28:53,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62179 conditions, 31581 events. 17159/31581 cut-off events. For 9587/10189 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 294373 event pairs, 6591 based on Foata normal form. 1030/27561 useless extension candidates. Maximal degree in co-relation 62142. Up to 12448 conditions per place. [2025-03-04 15:28:53,299 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 119 selfloop transitions, 5 changer transitions 0/168 dead transitions. [2025-03-04 15:28:53,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 168 transitions, 761 flow [2025-03-04 15:28:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-03-04 15:28:53,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7449494949494949 [2025-03-04 15:28:53,300 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 325 flow. Second operand 4 states and 295 transitions. [2025-03-04 15:28:53,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 168 transitions, 761 flow [2025-03-04 15:28:53,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 168 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:53,315 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 354 flow [2025-03-04 15:28:53,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-03-04 15:28:53,316 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 21 predicate places. [2025-03-04 15:28:53,316 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 354 flow [2025-03-04 15:28:53,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-03-04 15:28:53,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:53,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:53,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:28:53,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 911771228, now seen corresponding path program 1 times [2025-03-04 15:28:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370117459] [2025-03-04 15:28:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:53,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:28:53,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:28:53,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:53,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370117459] [2025-03-04 15:28:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370117459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:53,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019675013] [2025-03-04 15:28:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:53,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:53,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:53,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:28:53,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 99 [2025-03-04 15:28:53,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 55.4) internal successors, (277), 5 states have internal predecessors, (277), 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-03-04 15:28:53,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:53,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 99 [2025-03-04 15:28:53,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:54,407 INFO L124 PetriNetUnfolderBase]: 9780/19625 cut-off events. [2025-03-04 15:28:54,408 INFO L125 PetriNetUnfolderBase]: For 8263/9144 co-relation queries the response was YES. [2025-03-04 15:28:54,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39274 conditions, 19625 events. 9780/19625 cut-off events. For 8263/9144 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 185597 event pairs, 6980 based on Foata normal form. 534/17344 useless extension candidates. Maximal degree in co-relation 39235. Up to 12493 conditions per place. [2025-03-04 15:28:54,559 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 92 selfloop transitions, 5 changer transitions 2/149 dead transitions. [2025-03-04 15:28:54,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 149 transitions, 645 flow [2025-03-04 15:28:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 357 transitions. [2025-03-04 15:28:54,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2025-03-04 15:28:54,561 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 354 flow. Second operand 5 states and 357 transitions. [2025-03-04 15:28:54,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 149 transitions, 645 flow [2025-03-04 15:28:54,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 149 transitions, 645 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:28:54,581 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 379 flow [2025-03-04 15:28:54,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=379, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2025-03-04 15:28:54,581 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 27 predicate places. [2025-03-04 15:28:54,581 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 379 flow [2025-03-04 15:28:54,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.4) internal successors, (277), 5 states have internal predecessors, (277), 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-03-04 15:28:54,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:54,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:54,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:28:54,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:54,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1516880681, now seen corresponding path program 1 times [2025-03-04 15:28:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302358429] [2025-03-04 15:28:54,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:54,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:28:54,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:28:54,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:54,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:54,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302358429] [2025-03-04 15:28:54,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302358429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:54,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468853970] [2025-03-04 15:28:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:54,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:54,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:54,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:54,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 99 [2025-03-04 15:28:54,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-03-04 15:28:54,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:54,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 99 [2025-03-04 15:28:54,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:56,340 INFO L124 PetriNetUnfolderBase]: 17130/31218 cut-off events. [2025-03-04 15:28:56,340 INFO L125 PetriNetUnfolderBase]: For 16695/18031 co-relation queries the response was YES. [2025-03-04 15:28:56,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67536 conditions, 31218 events. 17130/31218 cut-off events. For 16695/18031 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 289384 event pairs, 7186 based on Foata normal form. 1360/28680 useless extension candidates. Maximal degree in co-relation 67494. Up to 13023 conditions per place. [2025-03-04 15:28:56,583 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 129 selfloop transitions, 5 changer transitions 0/178 dead transitions. [2025-03-04 15:28:56,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 178 transitions, 909 flow [2025-03-04 15:28:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2025-03-04 15:28:56,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73989898989899 [2025-03-04 15:28:56,585 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 379 flow. Second operand 4 states and 293 transitions. [2025-03-04 15:28:56,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 178 transitions, 909 flow [2025-03-04 15:28:56,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:56,655 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 408 flow [2025-03-04 15:28:56,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2025-03-04 15:28:56,656 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 30 predicate places. [2025-03-04 15:28:56,656 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 408 flow [2025-03-04 15:28:56,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-03-04 15:28:56,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:56,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:56,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:28:56,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:56,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash -523727402, now seen corresponding path program 1 times [2025-03-04 15:28:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514756412] [2025-03-04 15:28:56,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:56,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:28:56,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:28:56,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:56,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514756412] [2025-03-04 15:28:56,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514756412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337442260] [2025-03-04 15:28:56,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:56,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:28:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:28:56,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:28:56,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:56,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:56,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:28:56,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:56,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:28:57,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:28:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:57,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:57,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:28:57,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:28:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337442260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:57,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:28:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369313619] [2025-03-04 15:28:57,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:57,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:28:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:57,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:28:57,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:28:57,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 99 [2025-03-04 15:28:57,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 408 flow. Second operand has 13 states, 13 states have (on average 52.38461538461539) internal successors, (681), 13 states have internal predecessors, (681), 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-03-04 15:28:57,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:57,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 99 [2025-03-04 15:28:57,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:00,864 INFO L124 PetriNetUnfolderBase]: 26221/52267 cut-off events. [2025-03-04 15:29:00,865 INFO L125 PetriNetUnfolderBase]: For 32370/34804 co-relation queries the response was YES. [2025-03-04 15:29:01,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114980 conditions, 52267 events. 26221/52267 cut-off events. For 32370/34804 co-relation queries the response was YES. Maximal size of possible extension queue 1748. Compared 546734 event pairs, 6544 based on Foata normal form. 1330/48435 useless extension candidates. Maximal degree in co-relation 114936. Up to 12565 conditions per place. [2025-03-04 15:29:01,291 INFO L140 encePairwiseOnDemand]: 86/99 looper letters, 206 selfloop transitions, 19 changer transitions 1/274 dead transitions. [2025-03-04 15:29:01,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 274 transitions, 1408 flow [2025-03-04 15:29:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 704 transitions. [2025-03-04 15:29:01,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-03-04 15:29:01,294 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 408 flow. Second operand 10 states and 704 transitions. [2025-03-04 15:29:01,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 274 transitions, 1408 flow [2025-03-04 15:29:01,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 274 transitions, 1408 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:01,445 INFO L231 Difference]: Finished difference. Result has 136 places, 124 transitions, 521 flow [2025-03-04 15:29:01,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=521, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2025-03-04 15:29:01,446 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 42 predicate places. [2025-03-04 15:29:01,446 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 521 flow [2025-03-04 15:29:01,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 52.38461538461539) internal successors, (681), 13 states have internal predecessors, (681), 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-03-04 15:29:01,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:01,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:01,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:29:01,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 15:29:01,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash -221338471, now seen corresponding path program 1 times [2025-03-04 15:29:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034611775] [2025-03-04 15:29:01,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:01,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:01,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:01,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:01,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034611775] [2025-03-04 15:29:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034611775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088869739] [2025-03-04 15:29:01,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:01,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:01,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:01,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 99 [2025-03-04 15:29:01,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 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-03-04 15:29:01,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:01,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 99 [2025-03-04 15:29:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:05,034 INFO L124 PetriNetUnfolderBase]: 23111/47746 cut-off events. [2025-03-04 15:29:05,034 INFO L125 PetriNetUnfolderBase]: For 50591/53522 co-relation queries the response was YES. [2025-03-04 15:29:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112432 conditions, 47746 events. 23111/47746 cut-off events. For 50591/53522 co-relation queries the response was YES. Maximal size of possible extension queue 1759. Compared 515789 event pairs, 17246 based on Foata normal form. 1420/44171 useless extension candidates. Maximal degree in co-relation 112383. Up to 30459 conditions per place. [2025-03-04 15:29:05,669 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 66 selfloop transitions, 2 changer transitions 22/141 dead transitions. [2025-03-04 15:29:05,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 759 flow [2025-03-04 15:29:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-03-04 15:29:05,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6828282828282828 [2025-03-04 15:29:05,670 INFO L175 Difference]: Start difference. First operand has 136 places, 124 transitions, 521 flow. Second operand 5 states and 338 transitions. [2025-03-04 15:29:05,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 759 flow [2025-03-04 15:29:05,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 739 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:05,845 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 484 flow [2025-03-04 15:29:05,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2025-03-04 15:29:05,845 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 44 predicate places. [2025-03-04 15:29:05,845 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 484 flow [2025-03-04 15:29:05,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 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-03-04 15:29:05,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:05,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:05,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:29:05,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:05,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 944289596, now seen corresponding path program 1 times [2025-03-04 15:29:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15949509] [2025-03-04 15:29:05,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:05,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:05,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:05,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:06,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15949509] [2025-03-04 15:29:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15949509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287819591] [2025-03-04 15:29:06,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:06,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:06,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:06,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:06,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:29:06,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:06,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:06,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:06,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:06,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:29:06,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:06,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:29:06,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:29:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:06,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:06,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:29:06,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:29:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287819591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:06,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310352418] [2025-03-04 15:29:06,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:06,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:06,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:06,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:06,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 99 [2025-03-04 15:29:06,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 484 flow. Second operand has 13 states, 13 states have (on average 50.53846153846154) internal successors, (657), 13 states have internal predecessors, (657), 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-03-04 15:29:06,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:06,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 99 [2025-03-04 15:29:06,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:10,821 INFO L124 PetriNetUnfolderBase]: 31729/57139 cut-off events. [2025-03-04 15:29:10,821 INFO L125 PetriNetUnfolderBase]: For 56772/59842 co-relation queries the response was YES. [2025-03-04 15:29:11,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140697 conditions, 57139 events. 31729/57139 cut-off events. For 56772/59842 co-relation queries the response was YES. Maximal size of possible extension queue 1911. Compared 551208 event pairs, 8333 based on Foata normal form. 2016/54326 useless extension candidates. Maximal degree in co-relation 140658. Up to 16684 conditions per place. [2025-03-04 15:29:11,246 INFO L140 encePairwiseOnDemand]: 86/99 looper letters, 186 selfloop transitions, 18 changer transitions 0/249 dead transitions. [2025-03-04 15:29:11,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 249 transitions, 1364 flow [2025-03-04 15:29:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 660 transitions. [2025-03-04 15:29:11,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:29:11,248 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 484 flow. Second operand 10 states and 660 transitions. [2025-03-04 15:29:11,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 249 transitions, 1364 flow [2025-03-04 15:29:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 249 transitions, 1296 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-04 15:29:11,428 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 526 flow [2025-03-04 15:29:11,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=526, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2025-03-04 15:29:11,429 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 42 predicate places. [2025-03-04 15:29:11,429 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 526 flow [2025-03-04 15:29:11,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.53846153846154) internal successors, (657), 13 states have internal predecessors, (657), 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-03-04 15:29:11,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:11,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:11,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:29:11,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:11,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:11,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash -791793960, now seen corresponding path program 1 times [2025-03-04 15:29:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:11,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453263061] [2025-03-04 15:29:11,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:11,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:11,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:11,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:11,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453263061] [2025-03-04 15:29:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453263061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:11,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169674320] [2025-03-04 15:29:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:11,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:11,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 99 [2025-03-04 15:29:11,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 121 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:11,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:11,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 99 [2025-03-04 15:29:11,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:16,367 INFO L124 PetriNetUnfolderBase]: 39247/67277 cut-off events. [2025-03-04 15:29:16,368 INFO L125 PetriNetUnfolderBase]: For 68514/72105 co-relation queries the response was YES. [2025-03-04 15:29:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167739 conditions, 67277 events. 39247/67277 cut-off events. For 68514/72105 co-relation queries the response was YES. Maximal size of possible extension queue 2243. Compared 627218 event pairs, 7151 based on Foata normal form. 2583/66003 useless extension candidates. Maximal degree in co-relation 167693. Up to 33613 conditions per place. [2025-03-04 15:29:16,919 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 173 selfloop transitions, 6 changer transitions 0/223 dead transitions. [2025-03-04 15:29:16,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 223 transitions, 1207 flow [2025-03-04 15:29:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2025-03-04 15:29:16,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2025-03-04 15:29:16,921 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 526 flow. Second operand 5 states and 384 transitions. [2025-03-04 15:29:16,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 223 transitions, 1207 flow [2025-03-04 15:29:17,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 223 transitions, 1183 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:29:17,420 INFO L231 Difference]: Finished difference. Result has 135 places, 121 transitions, 517 flow [2025-03-04 15:29:17,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=135, PETRI_TRANSITIONS=121} [2025-03-04 15:29:17,420 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 41 predicate places. [2025-03-04 15:29:17,420 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 517 flow [2025-03-04 15:29:17,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:17,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:17,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:29:17,421 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1085750759, now seen corresponding path program 1 times [2025-03-04 15:29:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070688315] [2025-03-04 15:29:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:17,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:17,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:17,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:17,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070688315] [2025-03-04 15:29:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070688315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330696881] [2025-03-04 15:29:17,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:17,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:17,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:17,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:17,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:29:17,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:29:17,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:17,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:29:17,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:29:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:17,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:17,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:29:17,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:29:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330696881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:17,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:17,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495422060] [2025-03-04 15:29:17,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:17,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:17,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:17,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:17,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 99 [2025-03-04 15:29:17,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 121 transitions, 517 flow. Second operand has 13 states, 13 states have (on average 52.69230769230769) internal successors, (685), 13 states have internal predecessors, (685), 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-03-04 15:29:17,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:17,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 99 [2025-03-04 15:29:17,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:25,100 INFO L124 PetriNetUnfolderBase]: 51670/100274 cut-off events. [2025-03-04 15:29:25,101 INFO L125 PetriNetUnfolderBase]: For 113072/117970 co-relation queries the response was YES. [2025-03-04 15:29:25,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241395 conditions, 100274 events. 51670/100274 cut-off events. For 113072/117970 co-relation queries the response was YES. Maximal size of possible extension queue 2770. Compared 1089340 event pairs, 14294 based on Foata normal form. 3259/94726 useless extension candidates. Maximal degree in co-relation 241350. Up to 26126 conditions per place. [2025-03-04 15:29:26,016 INFO L140 encePairwiseOnDemand]: 86/99 looper letters, 212 selfloop transitions, 18 changer transitions 0/281 dead transitions. [2025-03-04 15:29:26,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 281 transitions, 1787 flow [2025-03-04 15:29:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 670 transitions. [2025-03-04 15:29:26,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2025-03-04 15:29:26,018 INFO L175 Difference]: Start difference. First operand has 135 places, 121 transitions, 517 flow. Second operand 10 states and 670 transitions. [2025-03-04 15:29:26,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 281 transitions, 1787 flow [2025-03-04 15:29:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 281 transitions, 1766 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:26,509 INFO L231 Difference]: Finished difference. Result has 146 places, 130 transitions, 619 flow [2025-03-04 15:29:26,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=619, PETRI_PLACES=146, PETRI_TRANSITIONS=130} [2025-03-04 15:29:26,510 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 52 predicate places. [2025-03-04 15:29:26,510 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 130 transitions, 619 flow [2025-03-04 15:29:26,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 52.69230769230769) internal successors, (685), 13 states have internal predecessors, (685), 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-03-04 15:29:26,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:26,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:26,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:29:26,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:26,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1224191647, now seen corresponding path program 1 times [2025-03-04 15:29:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678972550] [2025-03-04 15:29:26,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:26,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:26,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:26,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678972550] [2025-03-04 15:29:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678972550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349423998] [2025-03-04 15:29:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:26,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:26,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:29:26,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 99 [2025-03-04 15:29:26,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 130 transitions, 619 flow. Second operand has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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-03-04 15:29:26,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:26,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 99 [2025-03-04 15:29:26,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand