./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/28-race_reach_70-funloop_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:39:18,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:39:19,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:39:19,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:39:19,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:39:19,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:39:19,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:39:19,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:39:19,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:39:19,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:39:19,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:39:19,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:39:19,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:39:19,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:39:19,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:39:19,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:39:19,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:39:19,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:39:19,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:39:19,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:39:19,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:39:19,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:39:19,039 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 ! call(reach_error())) ) 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-03-13 21:39:19,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:39:19,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:39:19,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:39:19,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:39:19,289 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:39:19,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-13 21:39:20,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f3844a0/47f9f33662ee4186813bd2fdd6082cf0/FLAG8ad629fbc [2025-03-13 21:39:20,768 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:39:20,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-13 21:39:20,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f3844a0/47f9f33662ee4186813bd2fdd6082cf0/FLAG8ad629fbc [2025-03-13 21:39:21,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f3844a0/47f9f33662ee4186813bd2fdd6082cf0 [2025-03-13 21:39:21,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:39:21,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:39:21,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:39:21,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:39:21,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:39:21,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43866657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21, skipping insertion in model container [2025-03-13 21:39:21,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:39:21,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-03-13 21:39:21,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:39:21,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:39:21,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-03-13 21:39:21,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:39:21,456 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:39:21,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21 WrapperNode [2025-03-13 21:39:21,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:39:21,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:39:21,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:39:21,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:39:21,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,506 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 252 [2025-03-13 21:39:21,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:39:21,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:39:21,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:39:21,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:39:21,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,540 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-13 21:39:21,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:39:21,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:39:21,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:39:21,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:39:21,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (1/1) ... [2025-03-13 21:39:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:39:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:21,595 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-13 21:39:21,598 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-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:39:21,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:39:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:39:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:39:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:39:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:39:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:39:21,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:39:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 21:39:21,618 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 21:39:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:39:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:39:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:39:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:39:21,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:39:21,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:39:21,619 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:39:21,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:39:21,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:39:21,989 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 21:39:21,990 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 21:39:22,057 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:39:22,058 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:39:22,058 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:39:22,462 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:39:22,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:39:22 BoogieIcfgContainer [2025-03-13 21:39:22,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:39:22,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:39:22,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:39:22,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:39:22,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:39:21" (1/3) ... [2025-03-13 21:39:22,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593547ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:39:22, skipping insertion in model container [2025-03-13 21:39:22,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:21" (2/3) ... [2025-03-13 21:39:22,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593547ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:39:22, skipping insertion in model container [2025-03-13 21:39:22,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:39:22" (3/3) ... [2025-03-13 21:39:22,473 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-03-13 21:39:22,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:39:22,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 67 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-13 21:39:22,488 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:39:22,538 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 21:39:22,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 95 transitions, 197 flow [2025-03-13 21:39:22,620 INFO L124 PetriNetUnfolderBase]: 41/140 cut-off events. [2025-03-13 21:39:22,622 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:39:22,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 41/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 510 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 88. Up to 8 conditions per place. [2025-03-13 21:39:22,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 95 transitions, 197 flow [2025-03-13 21:39:22,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 93 transitions, 190 flow [2025-03-13 21:39:22,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:22,648 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;@5d755288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:22,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:39:22,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:22,659 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-13 21:39:22,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:22,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:22,660 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-13 21:39:22,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:39:22,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -463706937, now seen corresponding path program 1 times [2025-03-13 21:39:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994559435] [2025-03-13 21:39:22,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:22,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:39:22,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:39:22,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:22,902 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-13 21:39:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994559435] [2025-03-13 21:39:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994559435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:22,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564880830] [2025-03-13 21:39:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:22,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:22,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:22,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:22,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:22,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2025-03-13 21:39:22,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 93 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-13 21:39:22,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:22,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2025-03-13 21:39:22,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:23,264 INFO L124 PetriNetUnfolderBase]: 483/1297 cut-off events. [2025-03-13 21:39:23,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:23,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 1297 events. 483/1297 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8134 event pairs, 396 based on Foata normal form. 252/1381 useless extension candidates. Maximal degree in co-relation 2137. Up to 908 conditions per place. [2025-03-13 21:39:23,276 INFO L140 encePairwiseOnDemand]: 70/95 looper letters, 45 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-13 21:39:23,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 242 flow [2025-03-13 21:39:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-03-13 21:39:23,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-03-13 21:39:23,291 INFO L175 Difference]: Start difference. First operand has 69 places, 93 transitions, 190 flow. Second operand 3 states and 145 transitions. [2025-03-13 21:39:23,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 242 flow [2025-03-13 21:39:23,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:39:23,298 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 158 flow [2025-03-13 21:39:23,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2025-03-13 21:39:23,303 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 3 predicate places. [2025-03-13 21:39:23,305 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 158 flow [2025-03-13 21:39:23,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-13 21:39:23,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:23,306 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:23,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:39:23,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:39:23,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1596072188, now seen corresponding path program 1 times [2025-03-13 21:39:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135586608] [2025-03-13 21:39:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:23,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:39:23,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:39:23,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:23,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135586608] [2025-03-13 21:39:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135586608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648964476] [2025-03-13 21:39:23,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:23,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:23,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:23,441 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-13 21:39:23,442 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-13 21:39:23,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:39:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:39:23,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:23,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:23,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:39:23,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:23,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648964476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:23,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:39:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495444581] [2025-03-13 21:39:23,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:23,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:39:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:23,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:39:23,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:39:23,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2025-03-13 21:39:23,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-13 21:39:23,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:23,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2025-03-13 21:39:23,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:23,827 INFO L124 PetriNetUnfolderBase]: 483/1300 cut-off events. [2025-03-13 21:39:23,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:23,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 1300 events. 483/1300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8136 event pairs, 396 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 2214. Up to 908 conditions per place. [2025-03-13 21:39:23,833 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 45 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-13 21:39:23,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 270 flow [2025-03-13 21:39:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:39:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:39:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-13 21:39:23,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.356140350877193 [2025-03-13 21:39:23,835 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 158 flow. Second operand 6 states and 203 transitions. [2025-03-13 21:39:23,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 270 flow [2025-03-13 21:39:23,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 266 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:23,837 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 190 flow [2025-03-13 21:39:23,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-13 21:39:23,838 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2025-03-13 21:39:23,838 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 190 flow [2025-03-13 21:39:23,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-13 21:39:23,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:23,838 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:23,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:39:24,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:24,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:39:24,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1174686215, now seen corresponding path program 2 times [2025-03-13 21:39:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:24,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376157226] [2025-03-13 21:39:24,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:24,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:39:24,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:24,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:24,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376157226] [2025-03-13 21:39:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376157226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34914811] [2025-03-13 21:39:24,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:24,196 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-13 21:39:24,197 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-13 21:39:24,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:39:24,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:24,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:24,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:24,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:39:24,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:24,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34914811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:24,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:39:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67973721] [2025-03-13 21:39:24,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:24,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:39:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:24,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:39:24,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:39:24,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2025-03-13 21:39:24,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 190 flow. Second operand has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 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-13 21:39:24,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:24,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2025-03-13 21:39:24,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:24,613 INFO L124 PetriNetUnfolderBase]: 483/1304 cut-off events. [2025-03-13 21:39:24,613 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:39:24,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 1304 events. 483/1304 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8130 event pairs, 396 based on Foata normal form. 6/1142 useless extension candidates. Maximal degree in co-relation 2203. Up to 908 conditions per place. [2025-03-13 21:39:24,619 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 45 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-03-13 21:39:24,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 81 transitions, 338 flow [2025-03-13 21:39:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:39:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:39:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2025-03-13 21:39:24,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3175438596491228 [2025-03-13 21:39:24,624 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 190 flow. Second operand 12 states and 362 transitions. [2025-03-13 21:39:24,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 81 transitions, 338 flow [2025-03-13 21:39:24,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 324 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:24,630 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 260 flow [2025-03-13 21:39:24,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=260, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-03-13 21:39:24,631 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places. [2025-03-13 21:39:24,631 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 260 flow [2025-03-13 21:39:24,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 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-13 21:39:24,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:24,632 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:24,639 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-13 21:39:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-13 21:39:24,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:39:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1229878759, now seen corresponding path program 3 times [2025-03-13 21:39:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738427706] [2025-03-13 21:39:24,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:39:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:24,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-13 21:39:24,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:39:24,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-13 21:39:24,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:24,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:39:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:39:24,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:39:24,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:24,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:24,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:39:24,925 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:39:24,925 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-13 21:39:24,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:39:24,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-13 21:39:24,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-13 21:39:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:39:24,927 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:39:24,929 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:39:24,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:39:24,953 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:39:24,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 139 transitions, 294 flow [2025-03-13 21:39:24,972 INFO L124 PetriNetUnfolderBase]: 69/236 cut-off events. [2025-03-13 21:39:24,973 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:39:24,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 236 events. 69/236 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1095 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 142. Up to 12 conditions per place. [2025-03-13 21:39:24,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 139 transitions, 294 flow [2025-03-13 21:39:24,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 139 transitions, 294 flow [2025-03-13 21:39:24,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:24,976 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;@5d755288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:24,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:39:24,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:24,983 INFO L124 PetriNetUnfolderBase]: 7/58 cut-off events. [2025-03-13 21:39:24,983 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:39:24,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:24,983 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:24,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:39:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2076392325, now seen corresponding path program 1 times [2025-03-13 21:39:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:24,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695584970] [2025-03-13 21:39:24,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:24,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:39:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:39:24,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:25,029 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-13 21:39:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695584970] [2025-03-13 21:39:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695584970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442668822] [2025-03-13 21:39:25,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:25,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:25,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:25,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:25,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 139 [2025-03-13 21:39:25,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 139 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:25,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:25,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 139 [2025-03-13 21:39:25,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:27,210 INFO L124 PetriNetUnfolderBase]: 18464/35431 cut-off events. [2025-03-13 21:39:27,210 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-13 21:39:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62039 conditions, 35431 events. 18464/35431 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 325006 event pairs, 15876 based on Foata normal form. 7562/38531 useless extension candidates. Maximal degree in co-relation 50324. Up to 26505 conditions per place. [2025-03-13 21:39:27,404 INFO L140 encePairwiseOnDemand]: 103/139 looper letters, 68 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-13 21:39:27,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 370 flow [2025-03-13 21:39:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-03-13 21:39:27,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155875299760192 [2025-03-13 21:39:27,407 INFO L175 Difference]: Start difference. First operand has 102 places, 139 transitions, 294 flow. Second operand 3 states and 215 transitions. [2025-03-13 21:39:27,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 370 flow [2025-03-13 21:39:27,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 107 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:39:27,409 INFO L231 Difference]: Finished difference. Result has 105 places, 107 transitions, 240 flow [2025-03-13 21:39:27,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2025-03-13 21:39:27,412 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2025-03-13 21:39:27,412 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 240 flow [2025-03-13 21:39:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:27,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:27,412 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:27,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:39:27,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:39:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2062373135, now seen corresponding path program 1 times [2025-03-13 21:39:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698878997] [2025-03-13 21:39:27,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:27,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:27,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:27,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:27,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698878997] [2025-03-13 21:39:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698878997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:27,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059120585] [2025-03-13 21:39:27,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:27,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:27,482 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-13 21:39:27,484 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-13 21:39:27,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:27,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:27,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:27,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:27,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:39:27,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:27,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059120585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:27,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:39:27,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928823390] [2025-03-13 21:39:27,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:39:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:27,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:39:27,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:39:27,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 139 [2025-03-13 21:39:27,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-13 21:39:27,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 139 [2025-03-13 21:39:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:29,322 INFO L124 PetriNetUnfolderBase]: 18464/35434 cut-off events. [2025-03-13 21:39:29,322 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-13 21:39:29,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62055 conditions, 35434 events. 18464/35434 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 325032 event pairs, 15876 based on Foata normal form. 0/30972 useless extension candidates. Maximal degree in co-relation 62042. Up to 26505 conditions per place. [2025-03-13 21:39:29,522 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 68 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-13 21:39:29,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 398 flow [2025-03-13 21:39:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:39:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:39:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2025-03-13 21:39:29,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35731414868105515 [2025-03-13 21:39:29,524 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 240 flow. Second operand 6 states and 298 transitions. [2025-03-13 21:39:29,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 398 flow [2025-03-13 21:39:29,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:29,527 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 272 flow [2025-03-13 21:39:29,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2025-03-13 21:39:29,528 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2025-03-13 21:39:29,528 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 272 flow [2025-03-13 21:39:29,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-13 21:39:29,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:29,528 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:29,535 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-13 21:39:29,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:29,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:39:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -6376965, now seen corresponding path program 2 times [2025-03-13 21:39:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:29,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130577251] [2025-03-13 21:39:29,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:29,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:39:29,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:39:29,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130577251] [2025-03-13 21:39:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130577251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384161879] [2025-03-13 21:39:29,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:29,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:29,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:29,857 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-13 21:39:29,859 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-13 21:39:29,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:39:29,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:39:29,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:29,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:29,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:39:29,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:29,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384161879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:30,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:30,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:39:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150340378] [2025-03-13 21:39:30,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:30,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:39:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:30,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:39:30,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:39:30,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 139 [2025-03-13 21:39:30,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 272 flow. Second operand has 13 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 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-13 21:39:30,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:30,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 139 [2025-03-13 21:39:30,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:31,818 INFO L124 PetriNetUnfolderBase]: 18464/35440 cut-off events. [2025-03-13 21:39:31,818 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-03-13 21:39:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62092 conditions, 35440 events. 18464/35440 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 324991 event pairs, 15876 based on Foata normal form. 6/30985 useless extension candidates. Maximal degree in co-relation 62033. Up to 26505 conditions per place. [2025-03-13 21:39:32,125 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 68 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-13 21:39:32,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 116 transitions, 466 flow [2025-03-13 21:39:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:39:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:39:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 529 transitions. [2025-03-13 21:39:32,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31714628297362113 [2025-03-13 21:39:32,127 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 272 flow. Second operand 12 states and 529 transitions. [2025-03-13 21:39:32,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 116 transitions, 466 flow [2025-03-13 21:39:32,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 116 transitions, 452 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:32,132 INFO L231 Difference]: Finished difference. Result has 128 places, 116 transitions, 342 flow [2025-03-13 21:39:32,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=342, PETRI_PLACES=128, PETRI_TRANSITIONS=116} [2025-03-13 21:39:32,133 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 26 predicate places. [2025-03-13 21:39:32,134 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 342 flow [2025-03-13 21:39:32,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 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-13 21:39:32,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:32,134 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:32,140 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-13 21:39:32,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:32,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:39:32,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash 271609403, now seen corresponding path program 3 times [2025-03-13 21:39:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200430514] [2025-03-13 21:39:32,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:39:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:32,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-13 21:39:32,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:39:32,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-13 21:39:32,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:32,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:39:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:39:32,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:39:32,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:32,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:39:32,400 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:39:32,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:39:32,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:39:32,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:39:32,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:39:32,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:39:32,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:39:32,400 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:39:32,401 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:39:32,401 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:39:32,424 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:39:32,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 183 transitions, 393 flow [2025-03-13 21:39:32,441 INFO L124 PetriNetUnfolderBase]: 100/343 cut-off events. [2025-03-13 21:39:32,442 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:39:32,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 343 events. 100/343 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1750 event pairs, 1 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 245. Up to 16 conditions per place. [2025-03-13 21:39:32,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 183 transitions, 393 flow [2025-03-13 21:39:32,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 183 transitions, 393 flow [2025-03-13 21:39:32,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:32,447 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;@5d755288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:32,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:39:32,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:32,451 INFO L124 PetriNetUnfolderBase]: 17/93 cut-off events. [2025-03-13 21:39:32,451 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:39:32,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:32,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:32,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:39:32,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 134262972, now seen corresponding path program 1 times [2025-03-13 21:39:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825690525] [2025-03-13 21:39:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:32,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:39:32,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:39:32,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:32,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:32,484 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-13 21:39:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825690525] [2025-03-13 21:39:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825690525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:32,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:32,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:32,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974006139] [2025-03-13 21:39:32,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:32,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:32,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:32,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:32,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 183 [2025-03-13 21:39:32,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 183 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-13 21:39:32,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:32,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 183 [2025-03-13 21:39:32,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand