./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.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-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:30:45,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:30:45,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:30:45,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:30:45,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:30:45,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:30:45,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:30:45,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:30:45,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:30:45,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:30:45,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:30:45,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:30:45,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:30:45,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:30:45,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:30:45,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:30:45,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:30:45,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:30:45,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:30:45,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:30:45,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:30:45,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:30:45,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:30:45,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:30:45,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:30:45,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:30:45,924 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-03-04 15:30:46,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:30:46,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:30:46,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:30:46,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:30:46,145 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:30:46,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-04 15:30:47,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d326e313/6fe2615f7f984af8a73bab125790763e/FLAG2137f9ee8 [2025-03-04 15:30:47,503 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:30:47,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-04 15:30:47,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d326e313/6fe2615f7f984af8a73bab125790763e/FLAG2137f9ee8 [2025-03-04 15:30:47,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d326e313/6fe2615f7f984af8a73bab125790763e [2025-03-04 15:30:47,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:30:47,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:30:47,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:30:47,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:30:47,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:30:47,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:30:47" (1/1) ... [2025-03-04 15:30:47,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efc62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:47, skipping insertion in model container [2025-03-04 15:30:47,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:30:47" (1/1) ... [2025-03-04 15:30:47,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:30:47,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:30:47,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:30:47,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:30:48,002 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:30:48,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48 WrapperNode [2025-03-04 15:30:48,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:30:48,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:30:48,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:30:48,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:30:48,008 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:30:48" (1/1) ... [2025-03-04 15:30:48,012 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:30:48" (1/1) ... [2025-03-04 15:30:48,032 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 204 [2025-03-04 15:30:48,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:30:48,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:30:48,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:30:48,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:30:48,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,049 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:30:48,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:30:48,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:30:48,068 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:30:48,068 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:30:48,070 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (1/1) ... [2025-03-04 15:30:48,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:30:48,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:48,094 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:30:48,097 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:30:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:30:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:30:48,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:30:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:30:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:30:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:30:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:30:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:30:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:30:48,118 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:30:48,197 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:30:48,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:30:48,452 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:30:48,452 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:30:48,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:30:48,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:30:48,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:48 BoogieIcfgContainer [2025-03-04 15:30:48,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:30:48,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:30:48,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:30:48,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:30:48,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:30:47" (1/3) ... [2025-03-04 15:30:48,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1f7e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:30:48, skipping insertion in model container [2025-03-04 15:30:48,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:48" (2/3) ... [2025-03-04 15:30:48,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1f7e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:30:48, skipping insertion in model container [2025-03-04 15:30:48,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:48" (3/3) ... [2025-03-04 15:30:48,688 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-03-04 15:30:48,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:30:48,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 47 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-04 15:30:48,698 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:30:48,742 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:30:48,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 114 flow [2025-03-04 15:30:48,791 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-03-04 15:30:48,792 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:30:48,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 4/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-04 15:30:48,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 50 transitions, 114 flow [2025-03-04 15:30:48,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 46 transitions, 101 flow [2025-03-04 15:30:48,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:30:48,814 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;@60c5d754, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:30:48,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 15:30:48,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:30:48,820 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:30:48,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:30:48,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:48,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:30:48,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 572275, now seen corresponding path program 1 times [2025-03-04 15:30:48,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:48,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301641050] [2025-03-04 15:30:48,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:48,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:48,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:30:48,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:30:48,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:48,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:49,041 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:30:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301641050] [2025-03-04 15:30:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301641050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:49,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984104470] [2025-03-04 15:30:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:49,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:49,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:49,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:49,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:30:49,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:30:49,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:49,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:30:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:49,214 INFO L124 PetriNetUnfolderBase]: 215/476 cut-off events. [2025-03-04 15:30:49,214 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:30:49,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 476 events. 215/476 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2544 event pairs, 128 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 755. Up to 338 conditions per place. [2025-03-04 15:30:49,222 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 27 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2025-03-04 15:30:49,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 173 flow [2025-03-04 15:30:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 15:30:49,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-04 15:30:49,235 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 101 flow. Second operand 4 states and 106 transitions. [2025-03-04 15:30:49,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 173 flow [2025-03-04 15:30:49,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:49,241 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 148 flow [2025-03-04 15:30:49,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-03-04 15:30:49,247 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2025-03-04 15:30:49,247 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 148 flow [2025-03-04 15:30:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:30:49,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:49,248 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:30:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:30:49,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash -130708122, now seen corresponding path program 1 times [2025-03-04 15:30:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698757834] [2025-03-04 15:30:49,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:49,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:30:49,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:30:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698757834] [2025-03-04 15:30:49,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698757834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621201941] [2025-03-04 15:30:49,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:49,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:49,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:49,377 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:30:49,379 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:30:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:30:49,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:30:49,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:49,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:49,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:49,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621201941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:49,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:30:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575828623] [2025-03-04 15:30:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:30:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:30:49,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:30:49,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:30:49,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:49,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:49,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:30:49,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:49,670 INFO L124 PetriNetUnfolderBase]: 215/474 cut-off events. [2025-03-04 15:30:49,671 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:30:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 474 events. 215/474 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2523 event pairs, 128 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 806. Up to 328 conditions per place. [2025-03-04 15:30:49,676 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 20 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-03-04 15:30:49,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 204 flow [2025-03-04 15:30:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:30:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:30:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-04 15:30:49,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-04 15:30:49,681 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 148 flow. Second operand 6 states and 130 transitions. [2025-03-04 15:30:49,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 204 flow [2025-03-04 15:30:49,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:30:49,682 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 164 flow [2025-03-04 15:30:49,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-04 15:30:49,683 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-03-04 15:30:49,683 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 164 flow [2025-03-04 15:30:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:49,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:49,683 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:30:49,694 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:30:49,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:49,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:49,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash 243016032, now seen corresponding path program 1 times [2025-03-04 15:30:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112871632] [2025-03-04 15:30:49,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:49,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:49,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:49,987 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:30:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112871632] [2025-03-04 15:30:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112871632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335706515] [2025-03-04 15:30:49,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:49,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:49,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:49,989 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:30:49,991 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:30:50,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:50,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:50,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:50,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:50,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:50,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:50,064 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:30:50,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:50,106 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:30:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335706515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:50,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:30:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999718823] [2025-03-04 15:30:50,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:50,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:30:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:50,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:30:50,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:30:50,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:30:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 164 flow. Second operand has 12 states, 12 states have (on average 17.083333333333332) internal successors, (205), 12 states have internal predecessors, (205), 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:30:50,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:50,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:30:50,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:50,297 INFO L124 PetriNetUnfolderBase]: 221/498 cut-off events. [2025-03-04 15:30:50,298 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 15:30:50,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 498 events. 221/498 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2697 event pairs, 128 based on Foata normal form. 6/369 useless extension candidates. Maximal degree in co-relation 808. Up to 339 conditions per place. [2025-03-04 15:30:50,302 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 25 selfloop transitions, 25 changer transitions 0/64 dead transitions. [2025-03-04 15:30:50,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 378 flow [2025-03-04 15:30:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-03-04 15:30:50,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.432 [2025-03-04 15:30:50,305 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 164 flow. Second operand 10 states and 216 transitions. [2025-03-04 15:30:50,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 378 flow [2025-03-04 15:30:50,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 320 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:30:50,307 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 304 flow [2025-03-04 15:30:50,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-03-04 15:30:50,307 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2025-03-04 15:30:50,307 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 304 flow [2025-03-04 15:30:50,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.083333333333332) internal successors, (205), 12 states have internal predecessors, (205), 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:30:50,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:50,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:50,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:50,510 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,SelfDestructingSolverStorable2 [2025-03-04 15:30:50,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:50,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 279366524, now seen corresponding path program 1 times [2025-03-04 15:30:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:50,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799660735] [2025-03-04 15:30:50,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:50,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:50,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:50,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:50,579 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:30:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799660735] [2025-03-04 15:30:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799660735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:50,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:50,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:50,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072511102] [2025-03-04 15:30:50,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:50,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:50,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:50,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:50,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:30:50,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:30:50,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:50,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:30:50,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:50,665 INFO L124 PetriNetUnfolderBase]: 238/546 cut-off events. [2025-03-04 15:30:50,666 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-04 15:30:50,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 546 events. 238/546 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2943 event pairs, 146 based on Foata normal form. 13/424 useless extension candidates. Maximal degree in co-relation 989. Up to 350 conditions per place. [2025-03-04 15:30:50,670 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 48 selfloop transitions, 7 changer transitions 2/73 dead transitions. [2025-03-04 15:30:50,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 440 flow [2025-03-04 15:30:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 15:30:50,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:30:50,672 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 304 flow. Second operand 4 states and 120 transitions. [2025-03-04 15:30:50,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 440 flow [2025-03-04 15:30:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 416 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:50,675 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 303 flow [2025-03-04 15:30:50,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-03-04 15:30:50,675 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-03-04 15:30:50,675 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 303 flow [2025-03-04 15:30:50,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:30:50,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:50,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:50,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:30:50,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:50,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2139790397, now seen corresponding path program 1 times [2025-03-04 15:30:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541337178] [2025-03-04 15:30:50,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:50,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:30:50,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:30:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:50,768 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:30:50,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:50,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541337178] [2025-03-04 15:30:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541337178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:50,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423181626] [2025-03-04 15:30:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:50,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:50,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:50,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:50,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:30:50,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:30:50,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:50,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:30:50,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:50,888 INFO L124 PetriNetUnfolderBase]: 269/651 cut-off events. [2025-03-04 15:30:50,888 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:30:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 651 events. 269/651 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3672 event pairs, 174 based on Foata normal form. 12/516 useless extension candidates. Maximal degree in co-relation 1296. Up to 396 conditions per place. [2025-03-04 15:30:50,891 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 64 selfloop transitions, 4 changer transitions 4/88 dead transitions. [2025-03-04 15:30:50,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 571 flow [2025-03-04 15:30:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:30:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:30:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-04 15:30:50,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-03-04 15:30:50,892 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 303 flow. Second operand 5 states and 146 transitions. [2025-03-04 15:30:50,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 571 flow [2025-03-04 15:30:50,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:50,897 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 328 flow [2025-03-04 15:30:50,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-03-04 15:30:50,897 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-03-04 15:30:50,897 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 328 flow [2025-03-04 15:30:50,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:30:50,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:50,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:50,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:30:50,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2107460661, now seen corresponding path program 1 times [2025-03-04 15:30:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748728484] [2025-03-04 15:30:50,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:50,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:30:50,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:30:50,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:50,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,013 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:30:51,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:51,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748728484] [2025-03-04 15:30:51,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748728484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:51,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810339077] [2025-03-04 15:30:51,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:51,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:51,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:51,017 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:30:51,018 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:30:51,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:30:51,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:30:51,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:51,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:51,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:51,103 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:30:51,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810339077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:30:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013961294] [2025-03-04 15:30:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:51,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:51,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:51,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:30:51,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:30:51,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:30:51,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:51,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:30:51,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:51,162 INFO L124 PetriNetUnfolderBase]: 196/510 cut-off events. [2025-03-04 15:30:51,162 INFO L125 PetriNetUnfolderBase]: For 174/198 co-relation queries the response was YES. [2025-03-04 15:30:51,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 510 events. 196/510 cut-off events. For 174/198 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2788 event pairs, 124 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 1052. Up to 359 conditions per place. [2025-03-04 15:30:51,165 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 46 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-03-04 15:30:51,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 414 flow [2025-03-04 15:30:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-04 15:30:51,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-04 15:30:51,166 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 328 flow. Second operand 3 states and 84 transitions. [2025-03-04 15:30:51,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 414 flow [2025-03-04 15:30:51,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 401 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:51,168 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 309 flow [2025-03-04 15:30:51,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-04 15:30:51,168 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-04 15:30:51,168 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 309 flow [2025-03-04 15:30:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:30:51,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:51,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:51,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:51,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:51,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:51,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -744428560, now seen corresponding path program 1 times [2025-03-04 15:30:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480848553] [2025-03-04 15:30:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:51,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:51,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:51,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:51,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,495 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:30:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480848553] [2025-03-04 15:30:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480848553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931316407] [2025-03-04 15:30:51,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:51,498 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:30:51,499 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:30:51,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:51,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:51,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:51,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:51,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:51,607 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:30:51,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:51,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931316407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:51,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:51,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:30:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812088487] [2025-03-04 15:30:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:51,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:30:51,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:30:51,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:30:51,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:51,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:30:51,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:51,663 INFO L124 PetriNetUnfolderBase]: 142/406 cut-off events. [2025-03-04 15:30:51,663 INFO L125 PetriNetUnfolderBase]: For 151/159 co-relation queries the response was YES. [2025-03-04 15:30:51,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 406 events. 142/406 cut-off events. For 151/159 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2131 event pairs, 88 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 884. Up to 275 conditions per place. [2025-03-04 15:30:51,666 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 43 selfloop transitions, 1 changer transitions 1/61 dead transitions. [2025-03-04 15:30:51,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 391 flow [2025-03-04 15:30:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-04 15:30:51,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-04 15:30:51,668 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 309 flow. Second operand 3 states and 82 transitions. [2025-03-04 15:30:51,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 391 flow [2025-03-04 15:30:51,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:51,671 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 293 flow [2025-03-04 15:30:51,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-03-04 15:30:51,672 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-04 15:30:51,672 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 293 flow [2025-03-04 15:30:51,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:30:51,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:51,672 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:30:51,680 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:30:51,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:51,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1977768269, now seen corresponding path program 2 times [2025-03-04 15:30:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521167517] [2025-03-04 15:30:51,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:51,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:51,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:51,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:51,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521167517] [2025-03-04 15:30:51,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521167517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479096716] [2025-03-04 15:30:51,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:51,919 INFO L229 MonitoredProcess]: Starting monitored process 6 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:30:51,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:30:51,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:51,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:51,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:30:51,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:51,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:52,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479096716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:52,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602725197] [2025-03-04 15:30:52,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:52,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:52,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:52,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:52,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:30:52,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:52,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:52,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:30:52,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:52,078 INFO L124 PetriNetUnfolderBase]: 129/366 cut-off events. [2025-03-04 15:30:52,078 INFO L125 PetriNetUnfolderBase]: For 157/165 co-relation queries the response was YES. [2025-03-04 15:30:52,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 366 events. 129/366 cut-off events. For 157/165 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1822 event pairs, 75 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 796. Up to 234 conditions per place. [2025-03-04 15:30:52,080 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2025-03-04 15:30:52,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 373 flow [2025-03-04 15:30:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-04 15:30:52,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43 [2025-03-04 15:30:52,081 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 293 flow. Second operand 4 states and 86 transitions. [2025-03-04 15:30:52,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 373 flow [2025-03-04 15:30:52,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:52,083 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 314 flow [2025-03-04 15:30:52,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-04 15:30:52,083 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-04 15:30:52,083 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 314 flow [2025-03-04 15:30:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:52,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:52,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:52,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:52,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:52,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1608409736, now seen corresponding path program 1 times [2025-03-04 15:30:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213782799] [2025-03-04 15:30:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:52,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:30:52,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:30:52,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:52,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:30:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213782799] [2025-03-04 15:30:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213782799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135706140] [2025-03-04 15:30:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:52,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:52,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:52,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:52,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:30:52,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:30:52,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:52,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:30:52,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:52,395 INFO L124 PetriNetUnfolderBase]: 119/333 cut-off events. [2025-03-04 15:30:52,396 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-04 15:30:52,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 333 events. 119/333 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1544 event pairs, 40 based on Foata normal form. 6/303 useless extension candidates. Maximal degree in co-relation 761. Up to 124 conditions per place. [2025-03-04 15:30:52,399 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 47 selfloop transitions, 2 changer transitions 1/65 dead transitions. [2025-03-04 15:30:52,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 431 flow [2025-03-04 15:30:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 15:30:52,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-03-04 15:30:52,408 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 314 flow. Second operand 3 states and 87 transitions. [2025-03-04 15:30:52,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 431 flow [2025-03-04 15:30:52,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:52,410 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 296 flow [2025-03-04 15:30:52,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-03-04 15:30:52,411 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-04 15:30:52,411 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 296 flow [2025-03-04 15:30:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:30:52,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:52,411 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:30:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:30:52,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:52,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 618386034, now seen corresponding path program 1 times [2025-03-04 15:30:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735191767] [2025-03-04 15:30:52,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:52,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:52,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:52,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:52,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:52,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735191767] [2025-03-04 15:30:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735191767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740294194] [2025-03-04 15:30:52,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:52,545 INFO L229 MonitoredProcess]: Starting monitored process 7 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:30:52,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:30:52,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:52,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:52,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:52,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:30:52,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:52,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740294194] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:52,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:30:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462560493] [2025-03-04 15:30:52,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:52,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:30:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:52,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:30:52,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:30:52,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:30:52,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 296 flow. Second operand has 24 states, 24 states have (on average 17.083333333333332) internal successors, (410), 24 states have internal predecessors, (410), 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:30:52,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:52,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:30:52,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:53,032 INFO L124 PetriNetUnfolderBase]: 137/415 cut-off events. [2025-03-04 15:30:53,032 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-04 15:30:53,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 415 events. 137/415 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1972 event pairs, 80 based on Foata normal form. 12/373 useless extension candidates. Maximal degree in co-relation 1031. Up to 223 conditions per place. [2025-03-04 15:30:53,035 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 21 selfloop transitions, 61 changer transitions 0/96 dead transitions. [2025-03-04 15:30:53,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 96 transitions, 694 flow [2025-03-04 15:30:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:30:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:30:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 438 transitions. [2025-03-04 15:30:53,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3981818181818182 [2025-03-04 15:30:53,037 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 296 flow. Second operand 22 states and 438 transitions. [2025-03-04 15:30:53,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 96 transitions, 694 flow [2025-03-04 15:30:53,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 688 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:53,039 INFO L231 Difference]: Finished difference. Result has 88 places, 96 transitions, 692 flow [2025-03-04 15:30:53,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=692, PETRI_PLACES=88, PETRI_TRANSITIONS=96} [2025-03-04 15:30:53,040 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2025-03-04 15:30:53,040 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 96 transitions, 692 flow [2025-03-04 15:30:53,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 17.083333333333332) internal successors, (410), 24 states have internal predecessors, (410), 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:30:53,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:53,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:53,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:30:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:53,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2095673573, now seen corresponding path program 1 times [2025-03-04 15:30:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138715753] [2025-03-04 15:30:53,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:53,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:30:53,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:30:53,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:53,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:30:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138715753] [2025-03-04 15:30:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138715753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:53,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959844487] [2025-03-04 15:30:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:53,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:53,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:53,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:53,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:30:53,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 96 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:30:53,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:53,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:30:53,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:53,341 INFO L124 PetriNetUnfolderBase]: 119/365 cut-off events. [2025-03-04 15:30:53,341 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2025-03-04 15:30:53,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 365 events. 119/365 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1558 event pairs, 42 based on Foata normal form. 5/342 useless extension candidates. Maximal degree in co-relation 1048. Up to 152 conditions per place. [2025-03-04 15:30:53,342 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 84 selfloop transitions, 2 changer transitions 3/104 dead transitions. [2025-03-04 15:30:53,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 104 transitions, 895 flow [2025-03-04 15:30:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 15:30:53,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-03-04 15:30:53,343 INFO L175 Difference]: Start difference. First operand has 88 places, 96 transitions, 692 flow. Second operand 3 states and 89 transitions. [2025-03-04 15:30:53,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 104 transitions, 895 flow [2025-03-04 15:30:53,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 739 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-04 15:30:53,347 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 550 flow [2025-03-04 15:30:53,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2025-03-04 15:30:53,348 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2025-03-04 15:30:53,348 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 550 flow [2025-03-04 15:30:53,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:30:53,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:53,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:53,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:30:53,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:53,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -83377064, now seen corresponding path program 1 times [2025-03-04 15:30:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:53,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217562809] [2025-03-04 15:30:53,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:53,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:53,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:53,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:53,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217562809] [2025-03-04 15:30:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217562809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777044970] [2025-03-04 15:30:53,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:53,709 INFO L229 MonitoredProcess]: Starting monitored process 8 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:30:53,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:30:53,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:53,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:53,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:53,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:53,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:30:53,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:53,838 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 23 treesize of output 1 [2025-03-04 15:30:53,970 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:30:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:53,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:54,349 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 40 treesize of output 36 [2025-03-04 15:30:54,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:54,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 46 [2025-03-04 15:30:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:54,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777044970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:54,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:54,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:30:54,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583805180] [2025-03-04 15:30:54,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:54,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:30:54,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:54,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:30:54,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:30:54,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-04 15:30:54,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 550 flow. Second operand has 26 states, 26 states have (on average 13.73076923076923) internal successors, (357), 26 states have internal predecessors, (357), 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:30:54,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:54,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-04 15:30:54,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:57,302 INFO L124 PetriNetUnfolderBase]: 1118/2419 cut-off events. [2025-03-04 15:30:57,302 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2025-03-04 15:30:57,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5586 conditions, 2419 events. 1118/2419 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15452 event pairs, 57 based on Foata normal form. 0/2253 useless extension candidates. Maximal degree in co-relation 5559. Up to 341 conditions per place. [2025-03-04 15:30:57,313 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 263 selfloop transitions, 217 changer transitions 7/497 dead transitions. [2025-03-04 15:30:57,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 497 transitions, 2737 flow [2025-03-04 15:30:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 15:30:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2025-03-04 15:30:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 1388 transitions. [2025-03-04 15:30:57,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3605194805194805 [2025-03-04 15:30:57,317 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 550 flow. Second operand 77 states and 1388 transitions. [2025-03-04 15:30:57,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 497 transitions, 2737 flow [2025-03-04 15:30:57,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 497 transitions, 2606 flow, removed 64 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:57,326 INFO L231 Difference]: Finished difference. Result has 188 places, 267 transitions, 1789 flow [2025-03-04 15:30:57,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=1789, PETRI_PLACES=188, PETRI_TRANSITIONS=267} [2025-03-04 15:30:57,327 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 139 predicate places. [2025-03-04 15:30:57,327 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 267 transitions, 1789 flow [2025-03-04 15:30:57,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.73076923076923) internal successors, (357), 26 states have internal predecessors, (357), 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:30:57,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:57,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:57,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:30:57,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:57,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:57,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash -83390966, now seen corresponding path program 1 times [2025-03-04 15:30:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:57,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47365652] [2025-03-04 15:30:57,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:57,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:57,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:57,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:57,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47365652] [2025-03-04 15:30:58,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47365652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644673928] [2025-03-04 15:30:58,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:58,035 INFO L229 MonitoredProcess]: Starting monitored process 9 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:30:58,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:30:58,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:58,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:58,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:58,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:58,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:30:58,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:58,149 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 23 treesize of output 7 [2025-03-04 15:30:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:30:58,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644673928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:58,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:58,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 12 [2025-03-04 15:30:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933643222] [2025-03-04 15:30:58,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:30:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:58,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:30:58,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:30:58,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-04 15:30:58,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 267 transitions, 1789 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:30:58,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:58,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-04 15:30:58,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:58,652 INFO L124 PetriNetUnfolderBase]: 1944/4074 cut-off events. [2025-03-04 15:30:58,652 INFO L125 PetriNetUnfolderBase]: For 20945/21014 co-relation queries the response was YES. [2025-03-04 15:30:58,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13566 conditions, 4074 events. 1944/4074 cut-off events. For 20945/21014 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 29930 event pairs, 296 based on Foata normal form. 82/4086 useless extension candidates. Maximal degree in co-relation 13507. Up to 1738 conditions per place. [2025-03-04 15:30:58,680 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 321 selfloop transitions, 57 changer transitions 5/429 dead transitions. [2025-03-04 15:30:58,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 429 transitions, 3531 flow [2025-03-04 15:30:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:30:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:30:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-03-04 15:30:58,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-04 15:30:58,681 INFO L175 Difference]: Start difference. First operand has 188 places, 267 transitions, 1789 flow. Second operand 7 states and 180 transitions. [2025-03-04 15:30:58,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 429 transitions, 3531 flow [2025-03-04 15:30:58,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 429 transitions, 3153 flow, removed 171 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:58,717 INFO L231 Difference]: Finished difference. Result has 193 places, 310 transitions, 2129 flow [2025-03-04 15:30:58,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2129, PETRI_PLACES=193, PETRI_TRANSITIONS=310} [2025-03-04 15:30:58,718 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 144 predicate places. [2025-03-04 15:30:58,718 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 310 transitions, 2129 flow [2025-03-04 15:30:58,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:30:58,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:58,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:58,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:30:58,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:30:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2032828746, now seen corresponding path program 1 times [2025-03-04 15:30:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72700866] [2025-03-04 15:30:58,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:58,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:58,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:30:58,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:30:58,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:58,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72700866] [2025-03-04 15:30:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72700866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262948246] [2025-03-04 15:30:59,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:59,211 INFO L229 MonitoredProcess]: Starting monitored process 10 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:30:59,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:30:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:30:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:30:59,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:59,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:59,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 15:30:59,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:59,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:30:59,315 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 23 treesize of output 1 [2025-03-04 15:30:59,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:30:59,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:30:59,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:30:59,471 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:30:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:59,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:59,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:59,904 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 42 [2025-03-04 15:30:59,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:59,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 54 [2025-03-04 15:30:59,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:59,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2025-03-04 15:31:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262948246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:00,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:00,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2025-03-04 15:31:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351538648] [2025-03-04 15:31:00,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:00,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 15:31:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:00,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 15:31:00,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=492, Unknown=1, NotChecked=0, Total=600 [2025-03-04 15:31:00,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2025-03-04 15:31:00,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 310 transitions, 2129 flow. Second operand has 25 states, 25 states have (on average 9.4) internal successors, (235), 25 states have internal predecessors, (235), 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:31:00,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:00,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2025-03-04 15:31:00,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:03,135 INFO L124 PetriNetUnfolderBase]: 8576/15433 cut-off events. [2025-03-04 15:31:03,135 INFO L125 PetriNetUnfolderBase]: For 87928/88152 co-relation queries the response was YES. [2025-03-04 15:31:03,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53690 conditions, 15433 events. 8576/15433 cut-off events. For 87928/88152 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 119506 event pairs, 1024 based on Foata normal form. 552/14405 useless extension candidates. Maximal degree in co-relation 53628. Up to 5127 conditions per place. [2025-03-04 15:31:03,237 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 951 selfloop transitions, 355 changer transitions 33/1358 dead transitions. [2025-03-04 15:31:03,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1358 transitions, 10760 flow [2025-03-04 15:31:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 15:31:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 15:31:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 675 transitions. [2025-03-04 15:31:03,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2025-03-04 15:31:03,239 INFO L175 Difference]: Start difference. First operand has 193 places, 310 transitions, 2129 flow. Second operand 44 states and 675 transitions. [2025-03-04 15:31:03,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 1358 transitions, 10760 flow [2025-03-04 15:31:03,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 1358 transitions, 10736 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:03,455 INFO L231 Difference]: Finished difference. Result has 258 places, 630 transitions, 6287 flow [2025-03-04 15:31:03,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=6287, PETRI_PLACES=258, PETRI_TRANSITIONS=630} [2025-03-04 15:31:03,456 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 209 predicate places. [2025-03-04 15:31:03,456 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 630 transitions, 6287 flow [2025-03-04 15:31:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.4) internal successors, (235), 25 states have internal predecessors, (235), 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:31:03,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:03,456 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:03,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:03,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 15:31:03,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash 504984199, now seen corresponding path program 2 times [2025-03-04 15:31:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756067365] [2025-03-04 15:31:03,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:03,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 15:31:03,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 24 statements. [2025-03-04 15:31:03,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:03,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:31:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756067365] [2025-03-04 15:31:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756067365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:03,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376042911] [2025-03-04 15:31:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:03,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:03,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:03,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:03,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-04 15:31:03,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 630 transitions, 6287 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:31:03,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:03,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-04 15:31:03,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:05,618 INFO L124 PetriNetUnfolderBase]: 5017/10576 cut-off events. [2025-03-04 15:31:05,618 INFO L125 PetriNetUnfolderBase]: For 142703/143207 co-relation queries the response was YES. [2025-03-04 15:31:05,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50289 conditions, 10576 events. 5017/10576 cut-off events. For 142703/143207 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 93741 event pairs, 747 based on Foata normal form. 340/10726 useless extension candidates. Maximal degree in co-relation 50203. Up to 7011 conditions per place. [2025-03-04 15:31:05,713 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 621 selfloop transitions, 67 changer transitions 4/722 dead transitions. [2025-03-04 15:31:05,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 722 transitions, 8896 flow [2025-03-04 15:31:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-03-04 15:31:05,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2025-03-04 15:31:05,714 INFO L175 Difference]: Start difference. First operand has 258 places, 630 transitions, 6287 flow. Second operand 6 states and 158 transitions. [2025-03-04 15:31:05,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 722 transitions, 8896 flow [2025-03-04 15:31:06,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 722 transitions, 8468 flow, removed 208 selfloop flow, removed 6 redundant places. [2025-03-04 15:31:06,052 INFO L231 Difference]: Finished difference. Result has 258 places, 644 transitions, 6349 flow [2025-03-04 15:31:06,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5997, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6349, PETRI_PLACES=258, PETRI_TRANSITIONS=644} [2025-03-04 15:31:06,052 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 209 predicate places. [2025-03-04 15:31:06,053 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 644 transitions, 6349 flow [2025-03-04 15:31:06,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:31:06,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:06,053 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:06,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:31:06,053 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -566994366, now seen corresponding path program 1 times [2025-03-04 15:31:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:06,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54590061] [2025-03-04 15:31:06,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:06,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:31:06,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:31:06,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:06,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54590061] [2025-03-04 15:31:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54590061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835033581] [2025-03-04 15:31:06,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:06,153 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:06,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:31:06,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:31:06,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:31:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:06,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:31:06,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:06,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835033581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:06,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 15:31:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888286468] [2025-03-04 15:31:06,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:31:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:06,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:31:06,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:31:06,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:31:06,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 644 transitions, 6349 flow. Second operand has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 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:31:06,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:06,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:31:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:07,366 INFO L124 PetriNetUnfolderBase]: 2528/6110 cut-off events. [2025-03-04 15:31:07,366 INFO L125 PetriNetUnfolderBase]: For 77318/77745 co-relation queries the response was YES. [2025-03-04 15:31:07,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30017 conditions, 6110 events. 2528/6110 cut-off events. For 77318/77745 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 53779 event pairs, 944 based on Foata normal form. 369/6363 useless extension candidates. Maximal degree in co-relation 29930. Up to 2440 conditions per place. [2025-03-04 15:31:07,443 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 318 selfloop transitions, 86 changer transitions 3/459 dead transitions. [2025-03-04 15:31:07,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 459 transitions, 5585 flow [2025-03-04 15:31:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-03-04 15:31:07,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-04 15:31:07,448 INFO L175 Difference]: Start difference. First operand has 258 places, 644 transitions, 6349 flow. Second operand 8 states and 175 transitions. [2025-03-04 15:31:07,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 459 transitions, 5585 flow [2025-03-04 15:31:07,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 459 transitions, 5425 flow, removed 48 selfloop flow, removed 18 redundant places. [2025-03-04 15:31:07,723 INFO L231 Difference]: Finished difference. Result has 219 places, 416 transitions, 4369 flow [2025-03-04 15:31:07,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4180, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4369, PETRI_PLACES=219, PETRI_TRANSITIONS=416} [2025-03-04 15:31:07,724 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 170 predicate places. [2025-03-04 15:31:07,724 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 416 transitions, 4369 flow [2025-03-04 15:31:07,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 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:31:07,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:07,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:07,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:31:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:31:07,925 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -865617188, now seen corresponding path program 2 times [2025-03-04 15:31:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830486537] [2025-03-04 15:31:07,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:07,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:31:07,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 28 statements. [2025-03-04 15:31:07,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:07,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830486537] [2025-03-04 15:31:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830486537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531744520] [2025-03-04 15:31:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:08,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:08,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:08,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:08,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-04 15:31:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 416 transitions, 4369 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:31:08,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:08,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-04 15:31:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:08,777 INFO L124 PetriNetUnfolderBase]: 2952/6623 cut-off events. [2025-03-04 15:31:08,778 INFO L125 PetriNetUnfolderBase]: For 55944/56248 co-relation queries the response was YES. [2025-03-04 15:31:08,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30189 conditions, 6623 events. 2952/6623 cut-off events. For 55944/56248 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 55744 event pairs, 487 based on Foata normal form. 177/6658 useless extension candidates. Maximal degree in co-relation 30118. Up to 3447 conditions per place. [2025-03-04 15:31:08,827 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 336 selfloop transitions, 90 changer transitions 5/466 dead transitions. [2025-03-04 15:31:08,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 466 transitions, 5703 flow [2025-03-04 15:31:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-03-04 15:31:08,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-03-04 15:31:08,829 INFO L175 Difference]: Start difference. First operand has 219 places, 416 transitions, 4369 flow. Second operand 6 states and 153 transitions. [2025-03-04 15:31:08,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 466 transitions, 5703 flow [2025-03-04 15:31:09,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 466 transitions, 5542 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:31:09,042 INFO L231 Difference]: Finished difference. Result has 216 places, 415 transitions, 4377 flow [2025-03-04 15:31:09,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4197, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4377, PETRI_PLACES=216, PETRI_TRANSITIONS=415} [2025-03-04 15:31:09,043 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 167 predicate places. [2025-03-04 15:31:09,043 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 415 transitions, 4377 flow [2025-03-04 15:31:09,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:31:09,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:09,043 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:09,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:31:09,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:09,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2003030206, now seen corresponding path program 1 times [2025-03-04 15:31:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:09,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921354458] [2025-03-04 15:31:09,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:09,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:31:09,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:31:09,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:09,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:09,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921354458] [2025-03-04 15:31:09,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921354458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:09,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871459910] [2025-03-04 15:31:09,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:09,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:09,153 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:09,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:31:09,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:31:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:31:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:09,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:31:09,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:09,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:09,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871459910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:09,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:09,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:31:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421187534] [2025-03-04 15:31:09,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:09,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:31:09,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:09,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:31:09,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:31:09,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:31:09,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 415 transitions, 4377 flow. Second operand has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 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:31:09,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:09,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:31:09,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:10,054 INFO L124 PetriNetUnfolderBase]: 1389/3517 cut-off events. [2025-03-04 15:31:10,054 INFO L125 PetriNetUnfolderBase]: For 35326/35557 co-relation queries the response was YES. [2025-03-04 15:31:10,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15982 conditions, 3517 events. 1389/3517 cut-off events. For 35326/35557 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 27794 event pairs, 618 based on Foata normal form. 173/3602 useless extension candidates. Maximal degree in co-relation 15913. Up to 1553 conditions per place. [2025-03-04 15:31:10,087 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 256 selfloop transitions, 56 changer transitions 23/382 dead transitions. [2025-03-04 15:31:10,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 382 transitions, 4662 flow [2025-03-04 15:31:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:31:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:31:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 249 transitions. [2025-03-04 15:31:10,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415 [2025-03-04 15:31:10,088 INFO L175 Difference]: Start difference. First operand has 216 places, 415 transitions, 4377 flow. Second operand 12 states and 249 transitions. [2025-03-04 15:31:10,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 382 transitions, 4662 flow [2025-03-04 15:31:10,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 382 transitions, 4487 flow, removed 34 selfloop flow, removed 7 redundant places. [2025-03-04 15:31:10,168 INFO L231 Difference]: Finished difference. Result has 214 places, 311 transitions, 3241 flow [2025-03-04 15:31:10,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3241, PETRI_PLACES=214, PETRI_TRANSITIONS=311} [2025-03-04 15:31:10,169 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 165 predicate places. [2025-03-04 15:31:10,170 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 311 transitions, 3241 flow [2025-03-04 15:31:10,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 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:31:10,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:10,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:10,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:10,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:31:10,376 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1353874317, now seen corresponding path program 2 times [2025-03-04 15:31:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067676620] [2025-03-04 15:31:10,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:10,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:31:10,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:31:10,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:10,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:31:10,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:10,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067676620] [2025-03-04 15:31:10,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067676620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:10,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:10,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:10,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217698236] [2025-03-04 15:31:10,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:10,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:10,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:10,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:10,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:10,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:31:10,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 311 transitions, 3241 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:31:10,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:10,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:31:10,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:10,990 INFO L124 PetriNetUnfolderBase]: 1544/3697 cut-off events. [2025-03-04 15:31:10,990 INFO L125 PetriNetUnfolderBase]: For 37041/37448 co-relation queries the response was YES. [2025-03-04 15:31:11,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17184 conditions, 3697 events. 1544/3697 cut-off events. For 37041/37448 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 27602 event pairs, 399 based on Foata normal form. 116/3694 useless extension candidates. Maximal degree in co-relation 17117. Up to 1025 conditions per place. [2025-03-04 15:31:11,025 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 271 selfloop transitions, 25 changer transitions 30/366 dead transitions. [2025-03-04 15:31:11,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 366 transitions, 4545 flow [2025-03-04 15:31:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 15:31:11,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:31:11,026 INFO L175 Difference]: Start difference. First operand has 214 places, 311 transitions, 3241 flow. Second operand 4 states and 120 transitions. [2025-03-04 15:31:11,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 366 transitions, 4545 flow [2025-03-04 15:31:11,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 366 transitions, 4408 flow, removed 47 selfloop flow, removed 12 redundant places. [2025-03-04 15:31:11,098 INFO L231 Difference]: Finished difference. Result has 200 places, 263 transitions, 2840 flow [2025-03-04 15:31:11,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2838, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2840, PETRI_PLACES=200, PETRI_TRANSITIONS=263} [2025-03-04 15:31:11,098 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 151 predicate places. [2025-03-04 15:31:11,099 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 263 transitions, 2840 flow [2025-03-04 15:31:11,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:31:11,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,099 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:11,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:31:11,099 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:11,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -153221589, now seen corresponding path program 2 times [2025-03-04 15:31:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307598400] [2025-03-04 15:31:11,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 15:31:11,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:31:11,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:11,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:31:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307598400] [2025-03-04 15:31:11,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307598400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556090304] [2025-03-04 15:31:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:11,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:11,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-04 15:31:11,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 263 transitions, 2840 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:31:11,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-04 15:31:11,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:11,540 INFO L124 PetriNetUnfolderBase]: 1172/2862 cut-off events. [2025-03-04 15:31:11,540 INFO L125 PetriNetUnfolderBase]: For 31937/32364 co-relation queries the response was YES. [2025-03-04 15:31:11,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13300 conditions, 2862 events. 1172/2862 cut-off events. For 31937/32364 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20270 event pairs, 429 based on Foata normal form. 134/2918 useless extension candidates. Maximal degree in co-relation 13235. Up to 1051 conditions per place. [2025-03-04 15:31:11,561 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 205 selfloop transitions, 19 changer transitions 35/282 dead transitions. [2025-03-04 15:31:11,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 282 transitions, 3707 flow [2025-03-04 15:31:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-03-04 15:31:11,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-04 15:31:11,562 INFO L175 Difference]: Start difference. First operand has 200 places, 263 transitions, 2840 flow. Second operand 4 states and 122 transitions. [2025-03-04 15:31:11,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 282 transitions, 3707 flow [2025-03-04 15:31:11,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 282 transitions, 3394 flow, removed 156 selfloop flow, removed 15 redundant places. [2025-03-04 15:31:11,595 INFO L231 Difference]: Finished difference. Result has 167 places, 195 transitions, 2059 flow [2025-03-04 15:31:11,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2059, PETRI_PLACES=167, PETRI_TRANSITIONS=195} [2025-03-04 15:31:11,595 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 118 predicate places. [2025-03-04 15:31:11,596 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 195 transitions, 2059 flow [2025-03-04 15:31:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:31:11,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,596 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-03-04 15:31:11,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:31:11,596 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:11,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1521361262, now seen corresponding path program 2 times [2025-03-04 15:31:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418828303] [2025-03-04 15:31:11,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:31:11,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-04 15:31:11,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:11,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:31:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418828303] [2025-03-04 15:31:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418828303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24601178] [2025-03-04 15:31:11,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:11,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:11,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:11,631 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:11,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:31:11,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:31:11,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-04 15:31:11,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:11,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:31:11,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:31:11,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:31:11,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24601178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:11,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:11,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:31:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766461451] [2025-03-04 15:31:11,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:11,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:11,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 15:31:11,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 195 transitions, 2059 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:31:11,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 15:31:11,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,028 INFO L124 PetriNetUnfolderBase]: 973/2431 cut-off events. [2025-03-04 15:31:12,029 INFO L125 PetriNetUnfolderBase]: For 12749/13093 co-relation queries the response was YES. [2025-03-04 15:31:12,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9619 conditions, 2431 events. 973/2431 cut-off events. For 12749/13093 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17232 event pairs, 491 based on Foata normal form. 17/2406 useless extension candidates. Maximal degree in co-relation 9565. Up to 1561 conditions per place. [2025-03-04 15:31:12,044 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 84 selfloop transitions, 60 changer transitions 28/194 dead transitions. [2025-03-04 15:31:12,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 194 transitions, 2381 flow [2025-03-04 15:31:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-03-04 15:31:12,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.404 [2025-03-04 15:31:12,045 INFO L175 Difference]: Start difference. First operand has 167 places, 195 transitions, 2059 flow. Second operand 5 states and 101 transitions. [2025-03-04 15:31:12,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 194 transitions, 2381 flow [2025-03-04 15:31:12,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 194 transitions, 2257 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-04 15:31:12,059 INFO L231 Difference]: Finished difference. Result has 136 places, 166 transitions, 1756 flow [2025-03-04 15:31:12,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1756, PETRI_PLACES=136, PETRI_TRANSITIONS=166} [2025-03-04 15:31:12,060 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 87 predicate places. [2025-03-04 15:31:12,060 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 166 transitions, 1756 flow [2025-03-04 15:31:12,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:31:12,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:31:12,261 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2145080526, now seen corresponding path program 1 times [2025-03-04 15:31:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374544703] [2025-03-04 15:31:12,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:12,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374544703] [2025-03-04 15:31:12,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374544703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649222867] [2025-03-04 15:31:12,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:12,703 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31:12,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:31:12,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:12,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:12,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:31:12,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:12,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:31:12,865 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 23 treesize of output 1 [2025-03-04 15:31:12,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:31:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:31:12,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 15:31:13,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 15:31:13,376 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:31:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 15:31:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:13,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:13,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:13,805 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-04 15:31:13,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:13,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2025-03-04 15:31:13,814 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 16 treesize of output 9 [2025-03-04 15:31:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649222867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:14,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-04 15:31:14,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65047694] [2025-03-04 15:31:14,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 15:31:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 15:31:14,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1107, Unknown=1, NotChecked=0, Total=1260 [2025-03-04 15:31:14,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 15:31:14,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 166 transitions, 1756 flow. Second operand has 36 states, 36 states have (on average 11.694444444444445) internal successors, (421), 36 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:14,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 15:31:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:16,537 INFO L124 PetriNetUnfolderBase]: 3998/8304 cut-off events. [2025-03-04 15:31:16,537 INFO L125 PetriNetUnfolderBase]: For 26379/26953 co-relation queries the response was YES. [2025-03-04 15:31:16,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31038 conditions, 8304 events. 3998/8304 cut-off events. For 26379/26953 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 65175 event pairs, 680 based on Foata normal form. 340/8184 useless extension candidates. Maximal degree in co-relation 30999. Up to 1596 conditions per place. [2025-03-04 15:31:16,591 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 297 selfloop transitions, 229 changer transitions 18/558 dead transitions. [2025-03-04 15:31:16,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 558 transitions, 6256 flow [2025-03-04 15:31:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 15:31:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 15:31:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 569 transitions. [2025-03-04 15:31:16,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2917948717948718 [2025-03-04 15:31:16,593 INFO L175 Difference]: Start difference. First operand has 136 places, 166 transitions, 1756 flow. Second operand 39 states and 569 transitions. [2025-03-04 15:31:16,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 558 transitions, 6256 flow [2025-03-04 15:31:16,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 558 transitions, 5605 flow, removed 54 selfloop flow, removed 9 redundant places. [2025-03-04 15:31:16,622 INFO L231 Difference]: Finished difference. Result has 169 places, 316 transitions, 3625 flow [2025-03-04 15:31:16,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=3625, PETRI_PLACES=169, PETRI_TRANSITIONS=316} [2025-03-04 15:31:16,622 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 120 predicate places. [2025-03-04 15:31:16,622 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 316 transitions, 3625 flow [2025-03-04 15:31:16,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.694444444444445) internal successors, (421), 36 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:16,622 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:16,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:16,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:31:16,823 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:16,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash -523249462, now seen corresponding path program 1 times [2025-03-04 15:31:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720425576] [2025-03-04 15:31:16,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:16,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:16,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720425576] [2025-03-04 15:31:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720425576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332504703] [2025-03-04 15:31:17,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:17,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:17,333 INFO L229 MonitoredProcess]: Starting monitored process 15 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:31:17,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:31:17,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:17,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:17,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:17,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 15:31:17,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:17,502 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 23 treesize of output 1 [2025-03-04 15:31:17,857 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:31:17,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 15:31:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:31:17,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:18,156 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 21 treesize of output 19 [2025-03-04 15:31:18,159 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 31 treesize of output 24 [2025-03-04 15:31:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:31:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332504703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:18,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 39 [2025-03-04 15:31:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207363422] [2025-03-04 15:31:18,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:18,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 15:31:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:18,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 15:31:18,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 15:31:18,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 15:31:18,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 316 transitions, 3625 flow. Second operand has 40 states, 40 states have (on average 10.025) internal successors, (401), 40 states have internal predecessors, (401), 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:31:18,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:18,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 15:31:18,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:22,575 INFO L124 PetriNetUnfolderBase]: 12947/24165 cut-off events. [2025-03-04 15:31:22,575 INFO L125 PetriNetUnfolderBase]: For 115679/115679 co-relation queries the response was YES. [2025-03-04 15:31:22,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102751 conditions, 24165 events. 12947/24165 cut-off events. For 115679/115679 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 198779 event pairs, 1152 based on Foata normal form. 896/25019 useless extension candidates. Maximal degree in co-relation 102706. Up to 4573 conditions per place. [2025-03-04 15:31:22,770 INFO L140 encePairwiseOnDemand]: 33/50 looper letters, 793 selfloop transitions, 316 changer transitions 25/1140 dead transitions. [2025-03-04 15:31:22,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1140 transitions, 14627 flow [2025-03-04 15:31:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 15:31:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-04 15:31:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 670 transitions. [2025-03-04 15:31:22,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3116279069767442 [2025-03-04 15:31:22,772 INFO L175 Difference]: Start difference. First operand has 169 places, 316 transitions, 3625 flow. Second operand 43 states and 670 transitions. [2025-03-04 15:31:22,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 1140 transitions, 14627 flow [2025-03-04 15:31:23,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 1140 transitions, 13811 flow, removed 405 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:23,042 INFO L231 Difference]: Finished difference. Result has 221 places, 501 transitions, 6252 flow [2025-03-04 15:31:23,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3435, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=6252, PETRI_PLACES=221, PETRI_TRANSITIONS=501} [2025-03-04 15:31:23,043 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 172 predicate places. [2025-03-04 15:31:23,043 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 501 transitions, 6252 flow [2025-03-04 15:31:23,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 10.025) internal successors, (401), 40 states have internal predecessors, (401), 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:31:23,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:23,043 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:23,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 15:31:23,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:23,244 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:23,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -594274274, now seen corresponding path program 1 times [2025-03-04 15:31:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:23,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226271784] [2025-03-04 15:31:23,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:23,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:31:23,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:31:23,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:23,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226271784] [2025-03-04 15:31:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226271784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633212525] [2025-03-04 15:31:23,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:23,726 INFO L229 MonitoredProcess]: Starting monitored process 16 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:31:23,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:31:23,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:31:23,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:31:23,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:23,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:23,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:31:23,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:23,896 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 23 treesize of output 1 [2025-03-04 15:31:24,130 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:31:24,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 15:31:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:31:24,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:24,593 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 40 treesize of output 36 [2025-03-04 15:31:24,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:24,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-03-04 15:31:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:31:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633212525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:24,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:24,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 38 [2025-03-04 15:31:24,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259005172] [2025-03-04 15:31:24,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 15:31:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:24,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 15:31:24,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 15:31:25,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 15:31:25,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 501 transitions, 6252 flow. Second operand has 40 states, 40 states have (on average 13.05) internal successors, (522), 40 states have internal predecessors, (522), 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:31:25,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:25,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 15:31:25,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:29,905 INFO L124 PetriNetUnfolderBase]: 12600/25109 cut-off events. [2025-03-04 15:31:29,905 INFO L125 PetriNetUnfolderBase]: For 178622/180228 co-relation queries the response was YES. [2025-03-04 15:31:30,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122706 conditions, 25109 events. 12600/25109 cut-off events. For 178622/180228 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 222082 event pairs, 1114 based on Foata normal form. 1198/23474 useless extension candidates. Maximal degree in co-relation 122647. Up to 5184 conditions per place. [2025-03-04 15:31:30,068 INFO L140 encePairwiseOnDemand]: 33/50 looper letters, 558 selfloop transitions, 520 changer transitions 27/1151 dead transitions. [2025-03-04 15:31:30,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 1151 transitions, 15966 flow [2025-03-04 15:31:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 15:31:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-04 15:31:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 840 transitions. [2025-03-04 15:31:30,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.336 [2025-03-04 15:31:30,069 INFO L175 Difference]: Start difference. First operand has 221 places, 501 transitions, 6252 flow. Second operand 50 states and 840 transitions. [2025-03-04 15:31:30,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 1151 transitions, 15966 flow [2025-03-04 15:31:30,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1151 transitions, 15507 flow, removed 127 selfloop flow, removed 15 redundant places. [2025-03-04 15:31:30,803 INFO L231 Difference]: Finished difference. Result has 274 places, 797 transitions, 11230 flow [2025-03-04 15:31:30,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5855, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=11230, PETRI_PLACES=274, PETRI_TRANSITIONS=797} [2025-03-04 15:31:30,804 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 225 predicate places. [2025-03-04 15:31:30,804 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 797 transitions, 11230 flow [2025-03-04 15:31:30,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 13.05) internal successors, (522), 40 states have internal predecessors, (522), 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:31:30,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:30,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:30,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 15:31:31,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:31,005 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 15:31:31,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash -137625347, now seen corresponding path program 1 times [2025-03-04 15:31:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451410336] [2025-03-04 15:31:31,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:31,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:31:31,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:31:31,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:31,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:31:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451410336] [2025-03-04 15:31:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451410336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338931779] [2025-03-04 15:31:31,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:31,600 INFO L229 MonitoredProcess]: Starting monitored process 17 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:31:31,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:31:31,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:31:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:31:31,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:31,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:31,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 15:31:31,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:31,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:31:31,780 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 23 treesize of output 1 [2025-03-04 15:31:31,852 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:31:31,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:31:31,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:31:31,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:31:32,360 INFO L349 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2025-03-04 15:31:32,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-03-04 15:31:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:32,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:33,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:33,337 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 70 [2025-03-04 15:31:33,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:33,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 216 [2025-03-04 15:31:33,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:33,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 159 [2025-03-04 15:31:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338931779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:35,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:35,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 16] total 44 [2025-03-04 15:31:35,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29510870] [2025-03-04 15:31:35,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:35,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 15:31:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:35,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 15:31:35,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1842, Unknown=1, NotChecked=0, Total=2070 [2025-03-04 15:31:36,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2025-03-04 15:31:36,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 797 transitions, 11230 flow. Second operand has 46 states, 46 states have (on average 6.391304347826087) internal successors, (294), 46 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:36,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:36,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2025-03-04 15:31:36,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:44,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:31:49,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:32:07,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]