./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i --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/goblint-regression/04-mutex_36-trylock_nr.i -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 0bf2f5f336333cdf96c271b32cdeb9b70ee932e1c07acf27a63b4425ec902f3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:19:45,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:19:45,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:19:45,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:19:45,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:19:45,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:19:45,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:19:45,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:19:45,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:19:45,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:19:45,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:19:45,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:19:45,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:19:45,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:19:45,563 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:19:45,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:19:45,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:19:45,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:45,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:19:45,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:19:45,565 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 -> 0bf2f5f336333cdf96c271b32cdeb9b70ee932e1c07acf27a63b4425ec902f3e [2025-03-04 15:19:45,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:19:45,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:19:45,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:19:45,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:19:45,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:19:45,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-03-04 15:19:46,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1bc256b/e44df8d1121b4177a08ad461d5d9b531/FLAG81b77a11a [2025-03-04 15:19:47,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:19:47,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-03-04 15:19:47,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1bc256b/e44df8d1121b4177a08ad461d5d9b531/FLAG81b77a11a [2025-03-04 15:19:47,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1bc256b/e44df8d1121b4177a08ad461d5d9b531 [2025-03-04 15:19:47,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:19:47,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:19:47,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:19:47,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:19:47,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:19:47,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:47,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32641e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47, skipping insertion in model container [2025-03-04 15:19:47,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:47,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:19:47,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:19:47,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:19:47,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:19:47,964 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:19:47,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47 WrapperNode [2025-03-04 15:19:47,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:19:47,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:19:47,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:19:47,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:19:47,969 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:19:47" (1/1) ... [2025-03-04 15:19:47,987 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:19:47" (1/1) ... [2025-03-04 15:19:48,006 INFO L138 Inliner]: procedures = 525, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2025-03-04 15:19:48,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:19:48,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:19:48,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:19:48,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:19:48,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,029 INFO L175 MemorySlicer]: Split 13 memory accesses to 9 slices as follows [1, 5, 1, 1, 1, 1, 1, 1, 1]. 38 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [0, 5, 0, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [1, 0, 1, 1, 1, 1, 1, 1, 1]. [2025-03-04 15:19:48,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:19:48,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:19:48,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:19:48,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:19:48,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (1/1) ... [2025-03-04 15:19:48,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:48,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:48,083 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:19:48,101 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:19:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure counter_thread [2025-03-04 15:19:48,117 INFO L138 BoogieDeclarations]: Found implementation of procedure counter_thread [2025-03-04 15:19:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure monitor_thread [2025-03-04 15:19:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure monitor_thread [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:19:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:19:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 15:19:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 15:19:48,121 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:19:48,327 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:19:48,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:19:48,584 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:19:48,585 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:19:48,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:19:48,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:19:48,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:48 BoogieIcfgContainer [2025-03-04 15:19:48,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:19:48,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:19:48,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:19:48,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:19:48,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:19:47" (1/3) ... [2025-03-04 15:19:48,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd8b3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:19:48, skipping insertion in model container [2025-03-04 15:19:48,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:47" (2/3) ... [2025-03-04 15:19:48,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd8b3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:19:48, skipping insertion in model container [2025-03-04 15:19:48,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:48" (3/3) ... [2025-03-04 15:19:48,709 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_36-trylock_nr.i [2025-03-04 15:19:48,718 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:19:48,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_36-trylock_nr.i that has 3 procedures, 81 locations, 1 initial locations, 11 loop locations, and 10 error locations. [2025-03-04 15:19:48,720 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:19:48,769 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:19:48,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 111 transitions, 236 flow [2025-03-04 15:19:48,828 INFO L124 PetriNetUnfolderBase]: 31/109 cut-off events. [2025-03-04 15:19:48,830 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:19:48,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 31/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 275 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 85. Up to 5 conditions per place. [2025-03-04 15:19:48,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 111 transitions, 236 flow [2025-03-04 15:19:48,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 98 transitions, 205 flow [2025-03-04 15:19:48,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:19:48,850 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;@24c4bf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:19:48,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 15:19:48,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:19:48,852 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 15:19:48,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:19:48,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:48,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:19:48,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:48,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash 504369, now seen corresponding path program 1 times [2025-03-04 15:19:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732002422] [2025-03-04 15:19:48,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:49,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:19:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:19:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:49,150 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:19:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732002422] [2025-03-04 15:19:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732002422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:49,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:19:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683429141] [2025-03-04 15:19:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:19:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:49,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:19:49,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:19:49,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 111 [2025-03-04 15:19:49,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:19:49,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:49,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 111 [2025-03-04 15:19:49,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:49,383 INFO L124 PetriNetUnfolderBase]: 581/1350 cut-off events. [2025-03-04 15:19:49,383 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 15:19:49,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 1350 events. 581/1350 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8406 event pairs, 457 based on Foata normal form. 272/1390 useless extension candidates. Maximal degree in co-relation 2191. Up to 890 conditions per place. [2025-03-04 15:19:49,397 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 32 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2025-03-04 15:19:49,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 209 flow [2025-03-04 15:19:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:19:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:19:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2025-03-04 15:19:49,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5825825825825826 [2025-03-04 15:19:49,409 INFO L175 Difference]: Start difference. First operand has 78 places, 98 transitions, 205 flow. Second operand 3 states and 194 transitions. [2025-03-04 15:19:49,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 209 flow [2025-03-04 15:19:49,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:19:49,415 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 140 flow [2025-03-04 15:19:49,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-03-04 15:19:49,420 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -9 predicate places. [2025-03-04 15:19:49,420 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 140 flow [2025-03-04 15:19:49,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:19:49,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:49,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:19:49,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:19:49,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:49,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 15635818, now seen corresponding path program 1 times [2025-03-04 15:19:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646734291] [2025-03-04 15:19:49,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:49,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:19:49,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:19:49,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:49,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:49,516 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:19:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646734291] [2025-03-04 15:19:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646734291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:49,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:49,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:19:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648414924] [2025-03-04 15:19:49,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:49,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:19:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:49,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:19:49,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:19:49,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-04 15:19:49,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:19:49,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:49,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-04 15:19:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:49,634 INFO L124 PetriNetUnfolderBase]: 581/1349 cut-off events. [2025-03-04 15:19:49,634 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:19:49,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 1349 events. 581/1349 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8395 event pairs, 457 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2262. Up to 889 conditions per place. [2025-03-04 15:19:49,639 INFO L140 encePairwiseOnDemand]: 109/111 looper letters, 32 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2025-03-04 15:19:49,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 204 flow [2025-03-04 15:19:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:19:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:19:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-04 15:19:49,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255255255255256 [2025-03-04 15:19:49,645 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 140 flow. Second operand 3 states and 175 transitions. [2025-03-04 15:19:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 204 flow [2025-03-04 15:19:49,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:19:49,647 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 139 flow [2025-03-04 15:19:49,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-04 15:19:49,648 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -9 predicate places. [2025-03-04 15:19:49,649 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 139 flow [2025-03-04 15:19:49,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:19:49,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:49,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:49,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:19:49,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting counter_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:49,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2039076305, now seen corresponding path program 1 times [2025-03-04 15:19:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:49,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054578225] [2025-03-04 15:19:49,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:49,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:19:49,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:19:49,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:49,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:49,825 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:19:49,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054578225] [2025-03-04 15:19:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054578225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:19:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355078947] [2025-03-04 15:19:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:49,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:19:49,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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:19:49,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:49,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:19:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:50,173 INFO L124 PetriNetUnfolderBase]: 1611/3603 cut-off events. [2025-03-04 15:19:50,173 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:19:50,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 3603 events. 1611/3603 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 25016 event pairs, 393 based on Foata normal form. 48/3086 useless extension candidates. Maximal degree in co-relation 6228. Up to 1048 conditions per place. [2025-03-04 15:19:50,191 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 104 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-03-04 15:19:50,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 138 transitions, 507 flow [2025-03-04 15:19:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:19:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:19:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 344 transitions. [2025-03-04 15:19:50,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6198198198198198 [2025-03-04 15:19:50,193 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 139 flow. Second operand 5 states and 344 transitions. [2025-03-04 15:19:50,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 138 transitions, 507 flow [2025-03-04 15:19:50,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:19:50,195 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 172 flow [2025-03-04 15:19:50,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2025-03-04 15:19:50,198 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2025-03-04 15:19:50,198 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 172 flow [2025-03-04 15:19:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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:19:50,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:50,199 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:19:50,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:19:50,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1700470999, now seen corresponding path program 1 times [2025-03-04 15:19:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353250744] [2025-03-04 15:19:50,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:50,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:19:50,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:19:50,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:50,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:50,317 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:19:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353250744] [2025-03-04 15:19:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353250744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:19:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169685906] [2025-03-04 15:19:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:50,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:50,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:50,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:50,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 111 [2025-03-04 15:19:50,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 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:19:50,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:50,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 111 [2025-03-04 15:19:50,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:50,980 INFO L124 PetriNetUnfolderBase]: 3832/8241 cut-off events. [2025-03-04 15:19:50,980 INFO L125 PetriNetUnfolderBase]: For 882/996 co-relation queries the response was YES. [2025-03-04 15:19:50,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15468 conditions, 8241 events. 3832/8241 cut-off events. For 882/996 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 63783 event pairs, 1401 based on Foata normal form. 67/7237 useless extension candidates. Maximal degree in co-relation 15459. Up to 2524 conditions per place. [2025-03-04 15:19:51,017 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 105 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2025-03-04 15:19:51,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 141 transitions, 576 flow [2025-03-04 15:19:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:19:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:19:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2025-03-04 15:19:51,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108108108108108 [2025-03-04 15:19:51,020 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 172 flow. Second operand 5 states and 339 transitions. [2025-03-04 15:19:51,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 141 transitions, 576 flow [2025-03-04 15:19:51,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 141 transitions, 576 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:19:51,024 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 196 flow [2025-03-04 15:19:51,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-03-04 15:19:51,024 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-03-04 15:19:51,024 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 196 flow [2025-03-04 15:19:51,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 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:19:51,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:51,025 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:19:51,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:19:51,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting counter_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:51,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1047225198, now seen corresponding path program 1 times [2025-03-04 15:19:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026405846] [2025-03-04 15:19:51,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:51,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:19:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:19:51,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:51,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:51,102 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:19:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026405846] [2025-03-04 15:19:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026405846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:19:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013604447] [2025-03-04 15:19:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:51,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:51,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:51,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:51,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:19:51,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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:19:51,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:51,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:19:51,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:51,706 INFO L124 PetriNetUnfolderBase]: 4603/9884 cut-off events. [2025-03-04 15:19:51,707 INFO L125 PetriNetUnfolderBase]: For 1174/1302 co-relation queries the response was YES. [2025-03-04 15:19:51,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19334 conditions, 9884 events. 4603/9884 cut-off events. For 1174/1302 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 78654 event pairs, 3356 based on Foata normal form. 373/9066 useless extension candidates. Maximal degree in co-relation 19323. Up to 5931 conditions per place. [2025-03-04 15:19:51,745 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 80 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-04 15:19:51,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 114 transitions, 486 flow [2025-03-04 15:19:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:19:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:19:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-03-04 15:19:51,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2025-03-04 15:19:51,747 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 196 flow. Second operand 4 states and 258 transitions. [2025-03-04 15:19:51,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 114 transitions, 486 flow [2025-03-04 15:19:51,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 114 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:19:51,751 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 226 flow [2025-03-04 15:19:51,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-04 15:19:51,751 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 6 predicate places. [2025-03-04 15:19:51,751 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 226 flow [2025-03-04 15:19:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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:19:51,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:51,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:51,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:19:51,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting counter_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 757098282, now seen corresponding path program 1 times [2025-03-04 15:19:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659588486] [2025-03-04 15:19:51,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:51,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:19:51,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:19:51,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:51,882 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:19:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:51,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659588486] [2025-03-04 15:19:51,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659588486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:19:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132941774] [2025-03-04 15:19:51,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:51,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:51,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:51,886 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:19:51,886 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:19:51,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:19:51,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:19:51,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:51,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:51,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:19:51,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:19:52,026 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:19:52,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:19:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132941774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:52,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:19:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:19:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752800854] [2025-03-04 15:19:52,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:52,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:52,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:52,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:52,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:19:52,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:19:52,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 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:19:52,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:52,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:19:52,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:52,806 INFO L124 PetriNetUnfolderBase]: 4000/8849 cut-off events. [2025-03-04 15:19:52,806 INFO L125 PetriNetUnfolderBase]: For 3340/3472 co-relation queries the response was YES. [2025-03-04 15:19:52,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18391 conditions, 8849 events. 4000/8849 cut-off events. For 3340/3472 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 70345 event pairs, 821 based on Foata normal form. 330/8255 useless extension candidates. Maximal degree in co-relation 18377. Up to 3087 conditions per place. [2025-03-04 15:19:52,835 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 113 selfloop transitions, 4 changer transitions 0/147 dead transitions. [2025-03-04 15:19:52,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 147 transitions, 657 flow [2025-03-04 15:19:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:19:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:19:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 382 transitions. [2025-03-04 15:19:52,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5735735735735735 [2025-03-04 15:19:52,837 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 226 flow. Second operand 6 states and 382 transitions. [2025-03-04 15:19:52,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 147 transitions, 657 flow [2025-03-04 15:19:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:19:52,847 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 222 flow [2025-03-04 15:19:52,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2025-03-04 15:19:52,849 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2025-03-04 15:19:52,849 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 222 flow [2025-03-04 15:19:52,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 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:19:52,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:52,850 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:52,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:19:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:19:53,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting counter_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1995210789, now seen corresponding path program 1 times [2025-03-04 15:19:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069942551] [2025-03-04 15:19:53,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:53,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:19:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:19:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:53,137 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:19:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069942551] [2025-03-04 15:19:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069942551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:19:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675219199] [2025-03-04 15:19:53,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:53,139 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:19:53,141 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:19:53,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:19:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:19:53,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:53,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:53,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:19:53,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:19:53,257 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:19:53,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:19:53,309 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:19:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675219199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:19:53,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:19:53,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:19:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190519871] [2025-03-04 15:19:53,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:19:53,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:19:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:53,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:19:53,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:19:53,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:19:53,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 222 flow. Second operand has 12 states, 12 states have (on average 49.0) internal successors, (588), 12 states have internal predecessors, (588), 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:19:53,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:53,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:19:53,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:54,342 INFO L124 PetriNetUnfolderBase]: 6961/15800 cut-off events. [2025-03-04 15:19:54,342 INFO L125 PetriNetUnfolderBase]: For 7076/7324 co-relation queries the response was YES. [2025-03-04 15:19:54,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32798 conditions, 15800 events. 6961/15800 cut-off events. For 7076/7324 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 138187 event pairs, 821 based on Foata normal form. 663/14906 useless extension candidates. Maximal degree in co-relation 32783. Up to 2331 conditions per place. [2025-03-04 15:19:54,400 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 246 selfloop transitions, 15 changer transitions 0/291 dead transitions. [2025-03-04 15:19:54,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 291 transitions, 1378 flow [2025-03-04 15:19:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:19:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:19:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 739 transitions. [2025-03-04 15:19:54,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6052416052416052 [2025-03-04 15:19:54,405 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 222 flow. Second operand 11 states and 739 transitions. [2025-03-04 15:19:54,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 291 transitions, 1378 flow [2025-03-04 15:19:54,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 291 transitions, 1371 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:19:54,414 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 330 flow [2025-03-04 15:19:54,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=330, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2025-03-04 15:19:54,416 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-03-04 15:19:54,416 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 330 flow [2025-03-04 15:19:54,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 49.0) internal successors, (588), 12 states have internal predecessors, (588), 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:19:54,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:54,417 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:54,423 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:19:54,621 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,SelfDestructingSolverStorable6 [2025-03-04 15:19:54,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting counter_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:54,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:54,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1721992909, now seen corresponding path program 1 times [2025-03-04 15:19:54,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:54,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105022482] [2025-03-04 15:19:54,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:54,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:19:54,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:19:54,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:54,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105022482] [2025-03-04 15:19:54,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105022482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:19:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416941634] [2025-03-04 15:19:54,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:54,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:54,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:54,723 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:19:54,724 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:19:54,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:19:54,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:19:54,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:54,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:54,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:19:54,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:19:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:54,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:19:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416941634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:19:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:19:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479462486] [2025-03-04 15:19:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:54,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:54,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:54,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:19:54,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:19:54,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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:19:54,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:54,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:19:54,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:55,952 INFO L124 PetriNetUnfolderBase]: 7861/16447 cut-off events. [2025-03-04 15:19:55,952 INFO L125 PetriNetUnfolderBase]: For 11748/12088 co-relation queries the response was YES. [2025-03-04 15:19:55,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37321 conditions, 16447 events. 7861/16447 cut-off events. For 11748/12088 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 135315 event pairs, 776 based on Foata normal form. 219/14843 useless extension candidates. Maximal degree in co-relation 37300. Up to 7995 conditions per place. [2025-03-04 15:19:56,039 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 126 selfloop transitions, 13 changer transitions 0/167 dead transitions. [2025-03-04 15:19:56,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 167 transitions, 870 flow [2025-03-04 15:19:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:19:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:19:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 387 transitions. [2025-03-04 15:19:56,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2025-03-04 15:19:56,040 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 330 flow. Second operand 6 states and 387 transitions. [2025-03-04 15:19:56,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 167 transitions, 870 flow [2025-03-04 15:19:56,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 167 transitions, 836 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-03-04 15:19:56,069 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 330 flow [2025-03-04 15:19:56,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2025-03-04 15:19:56,070 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-03-04 15:19:56,070 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 330 flow [2025-03-04 15:19:56,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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:19:56,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:56,070 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:56,077 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:19:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:56,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting counter_threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:56,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1842173163, now seen corresponding path program 1 times [2025-03-04 15:19:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176776982] [2025-03-04 15:19:56,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:56,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:19:56,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:19:56,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:56,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:19:56,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:56,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176776982] [2025-03-04 15:19:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176776982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:19:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935537830] [2025-03-04 15:19:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:56,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:56,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:19:56,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:19:56,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:56,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:19:56,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:57,143 INFO L124 PetriNetUnfolderBase]: 7681/16206 cut-off events. [2025-03-04 15:19:57,143 INFO L125 PetriNetUnfolderBase]: For 13502/13750 co-relation queries the response was YES. [2025-03-04 15:19:57,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36752 conditions, 16206 events. 7681/16206 cut-off events. For 13502/13750 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 136093 event pairs, 4904 based on Foata normal form. 237/14775 useless extension candidates. Maximal degree in co-relation 36732. Up to 8680 conditions per place. [2025-03-04 15:19:57,212 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 76 selfloop transitions, 17 changer transitions 0/121 dead transitions. [2025-03-04 15:19:57,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 121 transitions, 643 flow [2025-03-04 15:19:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:19:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:19:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-03-04 15:19:57,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-04 15:19:57,213 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 330 flow. Second operand 4 states and 252 transitions. [2025-03-04 15:19:57,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 121 transitions, 643 flow [2025-03-04 15:19:57,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 622 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:19:57,240 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 378 flow [2025-03-04 15:19:57,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2025-03-04 15:19:57,241 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-03-04 15:19:57,241 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 378 flow [2025-03-04 15:19:57,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:19:57,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:57,242 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:19:57,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:57,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1140436572, now seen corresponding path program 1 times [2025-03-04 15:19:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:57,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863992785] [2025-03-04 15:19:57,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:57,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:19:57,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:19:57,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:57,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:57,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863992785] [2025-03-04 15:19:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863992785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:19:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492168235] [2025-03-04 15:19:57,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:57,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:57,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:57,328 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:19:57,329 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:19:57,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:19:57,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:19:57,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:57,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:19:57,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:19:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:57,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:19:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492168235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:19:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:19:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777696006] [2025-03-04 15:19:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:57,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:57,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:57,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:19:57,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 111 [2025-03-04 15:19:57,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 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:19:57,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:57,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 111 [2025-03-04 15:19:57,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:58,215 INFO L124 PetriNetUnfolderBase]: 7154/14551 cut-off events. [2025-03-04 15:19:58,215 INFO L125 PetriNetUnfolderBase]: For 17435/17879 co-relation queries the response was YES. [2025-03-04 15:19:58,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34188 conditions, 14551 events. 7154/14551 cut-off events. For 17435/17879 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 117632 event pairs, 293 based on Foata normal form. 373/13190 useless extension candidates. Maximal degree in co-relation 34168. Up to 3945 conditions per place. [2025-03-04 15:19:58,280 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 191 selfloop transitions, 4 changer transitions 0/224 dead transitions. [2025-03-04 15:19:58,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 224 transitions, 1640 flow [2025-03-04 15:19:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:19:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:19:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 399 transitions. [2025-03-04 15:19:58,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2025-03-04 15:19:58,282 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 378 flow. Second operand 6 states and 399 transitions. [2025-03-04 15:19:58,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 224 transitions, 1640 flow [2025-03-04 15:19:58,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 224 transitions, 1518 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:19:58,293 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 356 flow [2025-03-04 15:19:58,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2025-03-04 15:19:58,294 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2025-03-04 15:19:58,294 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 356 flow [2025-03-04 15:19:58,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 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:19:58,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:58,295 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:58,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:19:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:58,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:19:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash 993795854, now seen corresponding path program 1 times [2025-03-04 15:19:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411292190] [2025-03-04 15:19:58,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:58,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:58,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:19:58,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:19:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:58,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:58,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411292190] [2025-03-04 15:19:58,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411292190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:19:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633014383] [2025-03-04 15:19:58,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:58,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:19:58,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:58,570 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:19:58,572 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:19:58,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:19:58,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:19:58,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:58,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:58,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:19:58,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:19:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:58,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:19:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633014383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:19:58,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:19:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:19:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311578046] [2025-03-04 15:19:58,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:19:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:19:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:19:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:19:58,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 111 [2025-03-04 15:19:58,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 356 flow. Second operand has 12 states, 12 states have (on average 51.25) internal successors, (615), 12 states have internal predecessors, (615), 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:19:58,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:58,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 111 [2025-03-04 15:19:58,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:00,289 INFO L124 PetriNetUnfolderBase]: 11859/24084 cut-off events. [2025-03-04 15:20:00,289 INFO L125 PetriNetUnfolderBase]: For 22792/23536 co-relation queries the response was YES. [2025-03-04 15:20:00,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55361 conditions, 24084 events. 11859/24084 cut-off events. For 22792/23536 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 205428 event pairs, 622 based on Foata normal form. 416/21772 useless extension candidates. Maximal degree in co-relation 55340. Up to 3420 conditions per place. [2025-03-04 15:20:00,393 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 362 selfloop transitions, 11 changer transitions 0/402 dead transitions. [2025-03-04 15:20:00,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 402 transitions, 2868 flow [2025-03-04 15:20:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:20:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:20:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 734 transitions. [2025-03-04 15:20:00,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6011466011466011 [2025-03-04 15:20:00,396 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 356 flow. Second operand 11 states and 734 transitions. [2025-03-04 15:20:00,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 402 transitions, 2868 flow [2025-03-04 15:20:00,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 402 transitions, 2861 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:00,415 INFO L231 Difference]: Finished difference. Result has 109 places, 87 transitions, 403 flow [2025-03-04 15:20:00,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=403, PETRI_PLACES=109, PETRI_TRANSITIONS=87} [2025-03-04 15:20:00,416 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 31 predicate places. [2025-03-04 15:20:00,416 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 87 transitions, 403 flow [2025-03-04 15:20:00,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 51.25) internal successors, (615), 12 states have internal predecessors, (615), 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:20:00,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:00,417 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:00,423 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:20:00,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:20:00,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting counter_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:20:00,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1543119872, now seen corresponding path program 2 times [2025-03-04 15:20:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823423401] [2025-03-04 15:20:00,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:00,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:20:00,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:20:00,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823423401] [2025-03-04 15:20:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823423401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500454339] [2025-03-04 15:20:00,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:00,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:00,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:00,847 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:20:00,849 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:20:00,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:20:00,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:20:00,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:00,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:00,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:20:00,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:00,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:01,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500454339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:01,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:01,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 15:20:01,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270814427] [2025-03-04 15:20:01,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:01,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:20:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:01,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:20:01,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:20:01,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:20:01,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 87 transitions, 403 flow. Second operand has 24 states, 24 states have (on average 48.25) internal successors, (1158), 24 states have internal predecessors, (1158), 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:20:01,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:01,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:20:01,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:05,623 INFO L124 PetriNetUnfolderBase]: 26032/57971 cut-off events. [2025-03-04 15:20:05,623 INFO L125 PetriNetUnfolderBase]: For 94026/94320 co-relation queries the response was YES. [2025-03-04 15:20:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134684 conditions, 57971 events. 26032/57971 cut-off events. For 94026/94320 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 573845 event pairs, 1388 based on Foata normal form. 2210/54374 useless extension candidates. Maximal degree in co-relation 134660. Up to 7915 conditions per place. [2025-03-04 15:20:05,984 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 650 selfloop transitions, 43 changer transitions 0/721 dead transitions. [2025-03-04 15:20:05,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 721 transitions, 4444 flow [2025-03-04 15:20:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:20:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 15:20:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1564 transitions. [2025-03-04 15:20:05,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-03-04 15:20:05,988 INFO L175 Difference]: Start difference. First operand has 109 places, 87 transitions, 403 flow. Second operand 23 states and 1564 transitions. [2025-03-04 15:20:05,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 721 transitions, 4444 flow [2025-03-04 15:20:06,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 721 transitions, 4004 flow, removed 132 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:06,062 INFO L231 Difference]: Finished difference. Result has 139 places, 111 transitions, 739 flow [2025-03-04 15:20:06,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=739, PETRI_PLACES=139, PETRI_TRANSITIONS=111} [2025-03-04 15:20:06,063 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 61 predicate places. [2025-03-04 15:20:06,063 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 111 transitions, 739 flow [2025-03-04 15:20:06,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 48.25) internal successors, (1158), 24 states have internal predecessors, (1158), 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:20:06,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:06,063 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:06,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:06,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:06,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:20:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -9118925, now seen corresponding path program 2 times [2025-03-04 15:20:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304496803] [2025-03-04 15:20:06,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:06,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:20:06,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:20:06,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304496803] [2025-03-04 15:20:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304496803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614127902] [2025-03-04 15:20:06,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:06,516 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:20:06,518 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:20:06,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:20:06,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:20:06,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:06,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:20:06,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:06,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614127902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:06,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:20:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172184686] [2025-03-04 15:20:06,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:20:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:20:06,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:20:06,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 111 [2025-03-04 15:20:06,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 111 transitions, 739 flow. Second operand has 24 states, 24 states have (on average 51.125) internal successors, (1227), 24 states have internal predecessors, (1227), 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:20:06,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 111 [2025-03-04 15:20:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:18,409 INFO L124 PetriNetUnfolderBase]: 58425/117456 cut-off events. [2025-03-04 15:20:18,409 INFO L125 PetriNetUnfolderBase]: For 247188/250812 co-relation queries the response was YES. [2025-03-04 15:20:19,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287113 conditions, 117456 events. 58425/117456 cut-off events. For 247188/250812 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 1155261 event pairs, 1438 based on Foata normal form. 4082/109009 useless extension candidates. Maximal degree in co-relation 287076. Up to 16974 conditions per place. [2025-03-04 15:20:19,486 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 1316 selfloop transitions, 23 changer transitions 0/1368 dead transitions. [2025-03-04 15:20:19,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 1368 transitions, 14241 flow [2025-03-04 15:20:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:20:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 15:20:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1547 transitions. [2025-03-04 15:20:19,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6059537798668233 [2025-03-04 15:20:19,489 INFO L175 Difference]: Start difference. First operand has 139 places, 111 transitions, 739 flow. Second operand 23 states and 1547 transitions. [2025-03-04 15:20:19,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 1368 transitions, 14241 flow [2025-03-04 15:20:19,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 1368 transitions, 11863 flow, removed 264 selfloop flow, removed 10 redundant places. [2025-03-04 15:20:19,687 INFO L231 Difference]: Finished difference. Result has 157 places, 123 transitions, 759 flow [2025-03-04 15:20:19,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=759, PETRI_PLACES=157, PETRI_TRANSITIONS=123} [2025-03-04 15:20:19,688 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 79 predicate places. [2025-03-04 15:20:19,688 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 123 transitions, 759 flow [2025-03-04 15:20:19,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 51.125) internal successors, (1227), 24 states have internal predecessors, (1227), 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:20:19,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:19,689 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:19,694 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:20:19,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:19,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting counter_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [monitor_threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, monitor_threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 15:20:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1582080352, now seen corresponding path program 3 times [2025-03-04 15:20:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:19,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210373585] [2025-03-04 15:20:19,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:19,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 11 equivalence classes. [2025-03-04 15:20:19,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:20:19,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:20:19,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:20,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210373585] [2025-03-04 15:20:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210373585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410271431] [2025-03-04 15:20:20,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:20,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:20,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:20,389 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:20:20,390 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:20:20,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 11 equivalence classes. [2025-03-04 15:20:20,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:20:20,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:20:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:20,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:20:20,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:20,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410271431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:20,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 46 [2025-03-04 15:20:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382163735] [2025-03-04 15:20:20,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 15:20:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 15:20:20,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 15:20:21,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 111 [2025-03-04 15:20:21,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 123 transitions, 759 flow. Second operand has 48 states, 48 states have (on average 47.875) internal successors, (2298), 48 states have internal predecessors, (2298), 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:20:21,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:21,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 111 [2025-03-04 15:20:21,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand