./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:15:28,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:15:29,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:15:29,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:15:29,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:15:29,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:15:29,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:15:29,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:15:29,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:15:29,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:15:29,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:15:29,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:15:29,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:15:29,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:15:29,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:15:29,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:15:29,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:15:29,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:15:29,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:15:29,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:15:29,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:15:29,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:15:29,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:15:29,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:15:29,076 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-03-04 02:15:29,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:15:29,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:15:29,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:15:29,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:15:29,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:15:29,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-04 02:15:30,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba7338ef/2f9faca6065340b58b61c06b891dee01/FLAG3e5409d65 [2025-03-04 02:15:30,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:15:30,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-04 02:15:30,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba7338ef/2f9faca6065340b58b61c06b891dee01/FLAG3e5409d65 [2025-03-04 02:15:30,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba7338ef/2f9faca6065340b58b61c06b891dee01 [2025-03-04 02:15:31,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:15:31,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:15:31,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:15:31,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:15:31,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:15:31,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:15:30" (1/1) ... [2025-03-04 02:15:31,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66add3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31, skipping insertion in model container [2025-03-04 02:15:31,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:15:30" (1/1) ... [2025-03-04 02:15:31,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:15:31,300 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_72-funloop_hard_racing.i[41323,41336] [2025-03-04 02:15:31,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:15:31,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:15:31,395 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_72-funloop_hard_racing.i[41323,41336] [2025-03-04 02:15:31,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:15:31,444 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:15:31,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31 WrapperNode [2025-03-04 02:15:31,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:15:31,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:15:31,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:15:31,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:15:31,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,481 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-03-04 02:15:31,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:15:31,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:15:31,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:15:31,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:15:31,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,507 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 2, 75]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 7 writes are split as follows [0, 0, 1, 6]. [2025-03-04 02:15:31,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:15:31,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:15:31,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:15:31,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:15:31,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (1/1) ... [2025-03-04 02:15:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:15:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:15:31,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:15:31,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:15:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 02:15:31,565 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:15:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:15:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:15:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:15:31,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:15:31,567 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:15:31,676 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:15:31,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:15:32,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 02:15:32,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 02:15:32,086 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:15:32,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:15:32,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:15:32,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:15:32,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:15:32 BoogieIcfgContainer [2025-03-04 02:15:32,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:15:32,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:15:32,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:15:32,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:15:32,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:15:30" (1/3) ... [2025-03-04 02:15:32,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755eafa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:15:32, skipping insertion in model container [2025-03-04 02:15:32,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:15:31" (2/3) ... [2025-03-04 02:15:32,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755eafa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:15:32, skipping insertion in model container [2025-03-04 02:15:32,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:15:32" (3/3) ... [2025-03-04 02:15:32,386 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-03-04 02:15:32,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:15:32,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 94 locations, 1 initial locations, 17 loop locations, and 3 error locations. [2025-03-04 02:15:32,398 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:15:32,440 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 02:15:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 134 transitions, 275 flow [2025-03-04 02:15:32,517 INFO L124 PetriNetUnfolderBase]: 65/218 cut-off events. [2025-03-04 02:15:32,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:15:32,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 218 events. 65/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1015 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2025-03-04 02:15:32,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 134 transitions, 275 flow [2025-03-04 02:15:32,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 132 transitions, 268 flow [2025-03-04 02:15:32,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:15:32,548 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;@290cfdaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:15:32,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:15:32,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:15:32,557 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 02:15:32,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:15:32,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:32,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 02:15:32,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:15:32,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1877101698, now seen corresponding path program 1 times [2025-03-04 02:15:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560811246] [2025-03-04 02:15:32,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:32,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:15:32,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:15:32,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:32,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560811246] [2025-03-04 02:15:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560811246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:15:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:15:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:15:32,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153793633] [2025-03-04 02:15:32,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:15:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:15:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:32,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:15:32,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:15:32,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-04 02:15:32,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 132 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:32,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:32,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-04 02:15:32,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:15:33,197 INFO L124 PetriNetUnfolderBase]: 796/2157 cut-off events. [2025-03-04 02:15:33,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:15:33,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 2157 events. 796/2157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 15867 event pairs, 666 based on Foata normal form. 445/2369 useless extension candidates. Maximal degree in co-relation 3540. Up to 1494 conditions per place. [2025-03-04 02:15:33,216 INFO L140 encePairwiseOnDemand]: 98/134 looper letters, 60 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-04 02:15:33,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 328 flow [2025-03-04 02:15:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:15:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:15:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-04 02:15:33,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5223880597014925 [2025-03-04 02:15:33,228 INFO L175 Difference]: Start difference. First operand has 96 places, 132 transitions, 268 flow. Second operand 3 states and 210 transitions. [2025-03-04 02:15:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 328 flow [2025-03-04 02:15:33,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:15:33,236 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 214 flow [2025-03-04 02:15:33,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-03-04 02:15:33,241 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-03-04 02:15:33,241 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 214 flow [2025-03-04 02:15:33,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:33,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:33,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:15:33,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:15:33,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:15:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1530695626, now seen corresponding path program 1 times [2025-03-04 02:15:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694160069] [2025-03-04 02:15:33,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:33,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:15:33,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:15:33,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:33,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694160069] [2025-03-04 02:15:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694160069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:15:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606493014] [2025-03-04 02:15:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:33,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:15:33,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:15:33,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:15:33,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:15:33,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:15:33,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:33,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:33,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:15:33,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:15:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:33,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:15:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606493014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:15:33,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:15:33,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:15:33,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3754977] [2025-03-04 02:15:33,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:15:33,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:15:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:33,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:15:33,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:15:33,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-04 02:15:33,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:33,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:33,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-04 02:15:33,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:15:33,885 INFO L124 PetriNetUnfolderBase]: 796/2160 cut-off events. [2025-03-04 02:15:33,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:15:33,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 2160 events. 796/2160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 15836 event pairs, 666 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 3660. Up to 1494 conditions per place. [2025-03-04 02:15:33,898 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 60 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-04 02:15:33,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 356 flow [2025-03-04 02:15:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:15:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:15:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 296 transitions. [2025-03-04 02:15:33,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3681592039800995 [2025-03-04 02:15:33,903 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 214 flow. Second operand 6 states and 296 transitions. [2025-03-04 02:15:33,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 356 flow [2025-03-04 02:15:33,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:15:33,906 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 246 flow [2025-03-04 02:15:33,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-03-04 02:15:33,908 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-03-04 02:15:33,908 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 246 flow [2025-03-04 02:15:33,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:33,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:33,908 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-04 02:15:33,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:15:34,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:34,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:15:34,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1778590078, now seen corresponding path program 2 times [2025-03-04 02:15:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597418963] [2025-03-04 02:15:34,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:15:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:34,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 02:15:34,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:15:34,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:15:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:34,301 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-04 02:15:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597418963] [2025-03-04 02:15:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597418963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:15:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007275127] [2025-03-04 02:15:34,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:15:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:15:34,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:15:34,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:15:34,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 02:15:34,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:15:34,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:15:34,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:34,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:15:34,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:15:34,432 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-04 02:15:34,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:15:34,485 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-04 02:15:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007275127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:15:34,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:15:34,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:15:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257400954] [2025-03-04 02:15:34,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:15:34,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:15:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:34,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:15:34,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:15:34,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-04 02:15:34,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 246 flow. Second operand has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:34,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:34,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-04 02:15:34,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:15:34,777 INFO L124 PetriNetUnfolderBase]: 796/2166 cut-off events. [2025-03-04 02:15:34,777 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 02:15:34,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 2166 events. 796/2166 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 15876 event pairs, 666 based on Foata normal form. 6/1940 useless extension candidates. Maximal degree in co-relation 3651. Up to 1494 conditions per place. [2025-03-04 02:15:34,788 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 60 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2025-03-04 02:15:34,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 424 flow [2025-03-04 02:15:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:15:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:15:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 533 transitions. [2025-03-04 02:15:34,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3314676616915423 [2025-03-04 02:15:34,791 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 246 flow. Second operand 12 states and 533 transitions. [2025-03-04 02:15:34,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 424 flow [2025-03-04 02:15:34,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 410 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:15:34,794 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 316 flow [2025-03-04 02:15:34,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-03-04 02:15:34,794 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2025-03-04 02:15:34,795 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 316 flow [2025-03-04 02:15:34,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:34,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:34,795 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-03-04 02:15:34,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:15:34,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 02:15:34,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:15:34,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash -582100606, now seen corresponding path program 3 times [2025-03-04 02:15:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994385455] [2025-03-04 02:15:34,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:15:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:35,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-04 02:15:35,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:15:35,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:15:35,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:15:35,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:15:35,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:15:35,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:15:35,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:35,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:15:35,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:15:35,087 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:15:35,088 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:15:35,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:15:35,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:15:35,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:15:35,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:15:35,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:15:35,090 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-04 02:15:35,092 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:15:35,092 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:15:35,119 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:15:35,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 178 transitions, 372 flow [2025-03-04 02:15:35,138 INFO L124 PetriNetUnfolderBase]: 105/353 cut-off events. [2025-03-04 02:15:35,139 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:15:35,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 353 events. 105/353 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1902 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 220. Up to 12 conditions per place. [2025-03-04 02:15:35,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 178 transitions, 372 flow [2025-03-04 02:15:35,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 178 transitions, 372 flow [2025-03-04 02:15:35,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:15:35,144 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;@290cfdaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:15:35,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:15:35,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:15:35,149 INFO L124 PetriNetUnfolderBase]: 10/67 cut-off events. [2025-03-04 02:15:35,149 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:15:35,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:35,149 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-04 02:15:35,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:15:35,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:35,149 INFO L85 PathProgramCache]: Analyzing trace with hash -323793680, now seen corresponding path program 1 times [2025-03-04 02:15:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81111216] [2025-03-04 02:15:35,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:35,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:35,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:15:35,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:15:35,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:35,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81111216] [2025-03-04 02:15:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81111216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:15:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:15:35,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:15:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721807027] [2025-03-04 02:15:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:15:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:15:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:35,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:15:35,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:15:35,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-04 02:15:35,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 372 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-04 02:15:35,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:35,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-04 02:15:35,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:15:38,501 INFO L124 PetriNetUnfolderBase]: 30466/58308 cut-off events. [2025-03-04 02:15:38,502 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-04 02:15:38,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102116 conditions, 58308 events. 30466/58308 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 577982 event pairs, 26406 based on Foata normal form. 12981/64743 useless extension candidates. Maximal degree in co-relation 83019. Up to 43705 conditions per place. [2025-03-04 02:15:38,840 INFO L140 encePairwiseOnDemand]: 131/178 looper letters, 83 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-03-04 02:15:38,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 135 transitions, 456 flow [2025-03-04 02:15:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:15:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:15:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-03-04 02:15:38,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243445692883895 [2025-03-04 02:15:38,841 INFO L175 Difference]: Start difference. First operand has 129 places, 178 transitions, 372 flow. Second operand 3 states and 280 transitions. [2025-03-04 02:15:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 135 transitions, 456 flow [2025-03-04 02:15:38,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 135 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:15:38,847 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 296 flow [2025-03-04 02:15:38,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-03-04 02:15:38,848 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 3 predicate places. [2025-03-04 02:15:38,848 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 296 flow [2025-03-04 02:15:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-04 02:15:38,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:38,848 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:15:38,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:15:38,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:15:38,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1330434342, now seen corresponding path program 1 times [2025-03-04 02:15:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739679937] [2025-03-04 02:15:38,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:38,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:15:38,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:15:38,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:38,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:38,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739679937] [2025-03-04 02:15:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739679937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:15:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026274493] [2025-03-04 02:15:38,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:38,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:38,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:15:38,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:15:38,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:15:39,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:15:39,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:15:39,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:39,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:39,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:15:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:15:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:39,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:15:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026274493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:15:39,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:15:39,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:15:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475089022] [2025-03-04 02:15:39,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:15:39,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:15:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:39,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:15:39,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:15:39,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-04 02:15:39,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:39,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:39,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-04 02:15:39,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:15:41,847 INFO L124 PetriNetUnfolderBase]: 30466/58311 cut-off events. [2025-03-04 02:15:41,847 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-04 02:15:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102132 conditions, 58311 events. 30466/58311 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 578010 event pairs, 26406 based on Foata normal form. 0/51765 useless extension candidates. Maximal degree in co-relation 102119. Up to 43705 conditions per place. [2025-03-04 02:15:42,399 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 83 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2025-03-04 02:15:42,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 138 transitions, 484 flow [2025-03-04 02:15:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:15:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:15:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 391 transitions. [2025-03-04 02:15:42,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3661048689138577 [2025-03-04 02:15:42,401 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 296 flow. Second operand 6 states and 391 transitions. [2025-03-04 02:15:42,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 138 transitions, 484 flow [2025-03-04 02:15:42,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 480 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:15:42,403 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 328 flow [2025-03-04 02:15:42,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2025-03-04 02:15:42,404 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 10 predicate places. [2025-03-04 02:15:42,404 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 328 flow [2025-03-04 02:15:42,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:42,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:42,405 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 02:15:42,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:15:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:42,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:15:42,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -560892048, now seen corresponding path program 2 times [2025-03-04 02:15:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278948574] [2025-03-04 02:15:42,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:15:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:42,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:15:42,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:15:42,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:15:42,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:42,718 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-04 02:15:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278948574] [2025-03-04 02:15:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278948574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:15:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032727470] [2025-03-04 02:15:42,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:15:42,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:42,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:15:42,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:15:42,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:15:42,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:15:42,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:15:42,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:15:42,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:42,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:15:42,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:15:42,818 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-04 02:15:42,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:15:42,864 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-04 02:15:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032727470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:15:42,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:15:42,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:15:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939069333] [2025-03-04 02:15:42,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:15:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:15:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:42,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:15:42,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:15:42,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-04 02:15:42,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 328 flow. Second operand has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:42,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:42,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-04 02:15:42,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:15:46,080 INFO L124 PetriNetUnfolderBase]: 30466/58317 cut-off events. [2025-03-04 02:15:46,080 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-04 02:15:46,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102169 conditions, 58317 events. 30466/58317 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 578100 event pairs, 26406 based on Foata normal form. 6/51778 useless extension candidates. Maximal degree in co-relation 102110. Up to 43705 conditions per place. [2025-03-04 02:15:46,582 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 83 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-03-04 02:15:46,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 552 flow [2025-03-04 02:15:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:15:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:15:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 700 transitions. [2025-03-04 02:15:46,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32771535580524347 [2025-03-04 02:15:46,584 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 328 flow. Second operand 12 states and 700 transitions. [2025-03-04 02:15:46,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 552 flow [2025-03-04 02:15:46,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 538 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:15:46,587 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 398 flow [2025-03-04 02:15:46,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=398, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2025-03-04 02:15:46,588 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 26 predicate places. [2025-03-04 02:15:46,588 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 398 flow [2025-03-04 02:15:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:46,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:46,589 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 02:15:46,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:15:46,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:15:46,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:15:46,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash 736190256, now seen corresponding path program 3 times [2025-03-04 02:15:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:46,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381748424] [2025-03-04 02:15:46,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:15:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:46,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-04 02:15:46,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:15:46,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:15:46,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:15:46,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:15:46,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:15:46,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:15:46,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:46,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:15:46,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:15:46,855 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:15:46,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 02:15:46,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:15:46,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-04 02:15:46,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-04 02:15:46,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-04 02:15:46,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:15:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:15:46,856 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-04 02:15:46,857 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:15:46,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:15:46,883 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:15:46,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 222 transitions, 471 flow [2025-03-04 02:15:46,905 INFO L124 PetriNetUnfolderBase]: 148/499 cut-off events. [2025-03-04 02:15:46,905 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:15:46,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 499 events. 148/499 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2823 event pairs, 1 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 362. Up to 16 conditions per place. [2025-03-04 02:15:46,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 222 transitions, 471 flow [2025-03-04 02:15:46,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 222 transitions, 471 flow [2025-03-04 02:15:46,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:15:46,913 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;@290cfdaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:15:46,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:15:46,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:15:46,919 INFO L124 PetriNetUnfolderBase]: 29/149 cut-off events. [2025-03-04 02:15:46,919 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:15:46,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:15:46,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:15:46,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:15:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:15:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash -481979334, now seen corresponding path program 1 times [2025-03-04 02:15:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:15:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246167290] [2025-03-04 02:15:46,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:15:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:15:46,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:15:46,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:15:46,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:15:46,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:15:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:15:46,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:15:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246167290] [2025-03-04 02:15:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246167290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:15:46,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:15:46,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:15:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512158763] [2025-03-04 02:15:46,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:15:46,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:15:46,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:15:46,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:15:46,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:15:46,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 222 [2025-03-04 02:15:46,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 222 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:15:46,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:15:46,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 222 [2025-03-04 02:15:46,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand