./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_01-simple_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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:25:07,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:25:07,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:25:07,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:25:07,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:25:07,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:25:07,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:25:07,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:25:07,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:25:07,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:25:07,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:25:07,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:25:07,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:25:07,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:25:07,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:25:07,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:25:07,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:25:07,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:25:07,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:25:07,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:25:07,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:25:07,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:25:07,901 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-03-08 17:25:08,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:25:08,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:25:08,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:25:08,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:25:08,124 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:25:08,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-08 17:25:09,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d48e657/f6848bab5c6849b1bed9225c68c89c07/FLAG1212c527a [2025-03-08 17:25:09,500 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:25:09,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-08 17:25:09,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d48e657/f6848bab5c6849b1bed9225c68c89c07/FLAG1212c527a [2025-03-08 17:25:09,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d48e657/f6848bab5c6849b1bed9225c68c89c07 [2025-03-08 17:25:09,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:25:09,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:25:09,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:25:09,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:25:09,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:25:09,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:09" (1/1) ... [2025-03-08 17:25:09,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d655210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:09, skipping insertion in model container [2025-03-08 17:25:09,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:09" (1/1) ... [2025-03-08 17:25:09,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:25:10,055 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_01-simple_racing.i[30176,30189] [2025-03-08 17:25:10,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:25:10,094 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:25:10,129 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_01-simple_racing.i[30176,30189] [2025-03-08 17:25:10,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:25:10,171 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:25:10,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10 WrapperNode [2025-03-08 17:25:10,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:25:10,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:25:10,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:25:10,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:25:10,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,200 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-03-08 17:25:10,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:25:10,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:25:10,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:25:10,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:25:10,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,221 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-03-08 17:25:10,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:25:10,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:25:10,230 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:25:10,230 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:25:10,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:25:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:25:10,262 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-08 17:25:10,268 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-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:25:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 17:25:10,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:25:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:25:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:25:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 17:25:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:25:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:25:10,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:25:10,285 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:25:10,380 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:25:10,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:25:10,515 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 17:25:10,516 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 17:25:10,539 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:25:10,539 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:25:10,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:25:10,612 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:25:10,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10 BoogieIcfgContainer [2025-03-08 17:25:10,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:25:10,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:25:10,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:25:10,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:25:10,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:09" (1/3) ... [2025-03-08 17:25:10,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6c10e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:10, skipping insertion in model container [2025-03-08 17:25:10,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (2/3) ... [2025-03-08 17:25:10,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6c10e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:10, skipping insertion in model container [2025-03-08 17:25:10,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10" (3/3) ... [2025-03-08 17:25:10,620 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-03-08 17:25:10,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:25:10,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 38 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 17:25:10,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:25:10,667 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:25:10,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 48 transitions, 103 flow [2025-03-08 17:25:10,721 INFO L124 PetriNetUnfolderBase]: 13/68 cut-off events. [2025-03-08 17:25:10,723 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:25:10,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 68 events. 13/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 217 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2025-03-08 17:25:10,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 48 transitions, 103 flow [2025-03-08 17:25:10,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 46 transitions, 96 flow [2025-03-08 17:25:10,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:25:10,742 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;@404ebf62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:25:10,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 17:25:10,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:25:10,746 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-08 17:25:10,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:10,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:10,747 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-08 17:25:10,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:10,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:10,751 INFO L85 PathProgramCache]: Analyzing trace with hash -623342364, now seen corresponding path program 1 times [2025-03-08 17:25:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:10,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727746234] [2025-03-08 17:25:10,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:10,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:25:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:25:10,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:10,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:25:10,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:25:10,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:25:10,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:25:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:10,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:25:10,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:25:10,898 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:25:10,899 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-08 17:25:10,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 17:25:10,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:25:10,901 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 17:25:10,904 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:25:10,904 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:25:10,916 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:25:10,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 72 transitions, 160 flow [2025-03-08 17:25:10,946 INFO L124 PetriNetUnfolderBase]: 24/119 cut-off events. [2025-03-08 17:25:10,946 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:25:10,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 119 events. 24/119 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 466 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2025-03-08 17:25:10,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 72 transitions, 160 flow [2025-03-08 17:25:10,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 72 transitions, 160 flow [2025-03-08 17:25:10,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:25:10,950 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;@404ebf62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:25:10,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 17:25:10,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:25:10,957 INFO L124 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-03-08 17:25:10,957 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:25:10,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:10,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:10,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 575114507, now seen corresponding path program 1 times [2025-03-08 17:25:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839337876] [2025-03-08 17:25:10,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:10,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:25:10,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:25:10,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:10,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,069 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-08 17:25:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839337876] [2025-03-08 17:25:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839337876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:25:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551221350] [2025-03-08 17:25:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:25:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:25:11,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:25:11,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2025-03-08 17:25:11,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 17:25:11,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2025-03-08 17:25:11,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,555 INFO L124 PetriNetUnfolderBase]: 2414/4747 cut-off events. [2025-03-08 17:25:11,555 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-08 17:25:11,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8705 conditions, 4747 events. 2414/4747 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 34222 event pairs, 1116 based on Foata normal form. 1001/5419 useless extension candidates. Maximal degree in co-relation 819. Up to 3889 conditions per place. [2025-03-08 17:25:11,580 INFO L140 encePairwiseOnDemand]: 54/72 looper letters, 36 selfloop transitions, 2 changer transitions 11/68 dead transitions. [2025-03-08 17:25:11,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 246 flow [2025-03-08 17:25:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:25:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:25:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-03-08 17:25:11,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-08 17:25:11,593 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 160 flow. Second operand 3 states and 132 transitions. [2025-03-08 17:25:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 246 flow [2025-03-08 17:25:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:25:11,602 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 114 flow [2025-03-08 17:25:11,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-03-08 17:25:11,607 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-03-08 17:25:11,607 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 114 flow [2025-03-08 17:25:11,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 17:25:11,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,608 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-08 17:25:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:25:11,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 743746701, now seen corresponding path program 1 times [2025-03-08 17:25:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149730800] [2025-03-08 17:25:11,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:25:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:25:11,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:25:11,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:25:11,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:25:11,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:25:11,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:25:11,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:25:11,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:25:11,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-08 17:25:11,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 17:25:11,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:25:11,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 17:25:11,664 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:25:11,664 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 17:25:11,686 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:25:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 96 transitions, 219 flow [2025-03-08 17:25:11,702 INFO L124 PetriNetUnfolderBase]: 38/181 cut-off events. [2025-03-08 17:25:11,703 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 17:25:11,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 181 events. 38/181 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 777 event pairs, 1 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 130. Up to 12 conditions per place. [2025-03-08 17:25:11,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 96 transitions, 219 flow [2025-03-08 17:25:11,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 96 transitions, 219 flow [2025-03-08 17:25:11,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:25:11,706 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;@404ebf62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:25:11,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 17:25:11,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:25:11,710 INFO L124 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-03-08 17:25:11,710 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:25:11,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:11,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1772765941, now seen corresponding path program 1 times [2025-03-08 17:25:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927336608] [2025-03-08 17:25:11,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:25:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:25:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,759 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-08 17:25:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927336608] [2025-03-08 17:25:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927336608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:25:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494496628] [2025-03-08 17:25:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:25:11,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:25:11,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:25:11,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 96 [2025-03-08 17:25:11,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-08 17:25:11,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 96 [2025-03-08 17:25:11,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:15,316 INFO L124 PetriNetUnfolderBase]: 38401/62684 cut-off events. [2025-03-08 17:25:15,316 INFO L125 PetriNetUnfolderBase]: For 1267/1267 co-relation queries the response was YES. [2025-03-08 17:25:15,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117311 conditions, 62684 events. 38401/62684 cut-off events. For 1267/1267 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 534734 event pairs, 24832 based on Foata normal form. 14708/73743 useless extension candidates. Maximal degree in co-relation 8766. Up to 53816 conditions per place. [2025-03-08 17:25:15,545 INFO L140 encePairwiseOnDemand]: 72/96 looper letters, 46 selfloop transitions, 2 changer transitions 12/86 dead transitions. [2025-03-08 17:25:15,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 86 transitions, 315 flow [2025-03-08 17:25:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:25:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:25:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2025-03-08 17:25:15,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2025-03-08 17:25:15,548 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 219 flow. Second operand 3 states and 170 transitions. [2025-03-08 17:25:15,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 86 transitions, 315 flow [2025-03-08 17:25:15,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 315 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:25:15,553 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 156 flow [2025-03-08 17:25:15,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2025-03-08 17:25:15,555 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-03-08 17:25:15,555 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 156 flow [2025-03-08 17:25:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-08 17:25:15,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:15,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:25:15,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2083073781, now seen corresponding path program 1 times [2025-03-08 17:25:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:15,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796208386] [2025-03-08 17:25:15,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:15,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:25:15,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:25:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:15,641 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-08 17:25:15,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796208386] [2025-03-08 17:25:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796208386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:25:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616290240] [2025-03-08 17:25:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:25:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:25:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:25:15,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 96 [2025-03-08 17:25:15,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-08 17:25:15,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:15,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 96 [2025-03-08 17:25:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:17,391 INFO L124 PetriNetUnfolderBase]: 19188/32487 cut-off events. [2025-03-08 17:25:17,392 INFO L125 PetriNetUnfolderBase]: For 2919/2919 co-relation queries the response was YES. [2025-03-08 17:25:17,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62067 conditions, 32487 events. 19188/32487 cut-off events. For 2919/2919 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 269024 event pairs, 12150 based on Foata normal form. 10/31894 useless extension candidates. Maximal degree in co-relation 6356. Up to 26681 conditions per place. [2025-03-08 17:25:17,512 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 65 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-08 17:25:17,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 354 flow [2025-03-08 17:25:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:25:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:25:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2025-03-08 17:25:17,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4713541666666667 [2025-03-08 17:25:17,514 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 156 flow. Second operand 4 states and 181 transitions. [2025-03-08 17:25:17,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 354 flow [2025-03-08 17:25:17,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 350 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:25:17,516 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 168 flow [2025-03-08 17:25:17,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-03-08 17:25:17,516 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2025-03-08 17:25:17,516 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 168 flow [2025-03-08 17:25:17,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-08 17:25:17,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:17,517 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-08 17:25:17,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:25:17,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:17,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1117278109, now seen corresponding path program 1 times [2025-03-08 17:25:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031114138] [2025-03-08 17:25:17,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:17,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:25:17,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:25:17,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:25:17,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:25:17,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:25:17,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:25:17,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:17,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:25:17,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:25:17,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:25:17,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-08 17:25:17,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 17:25:17,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:25:17,547 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 17:25:17,548 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:25:17,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 17:25:17,569 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 17:25:17,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 120 transitions, 280 flow [2025-03-08 17:25:17,586 INFO L124 PetriNetUnfolderBase]: 60/267 cut-off events. [2025-03-08 17:25:17,587 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-08 17:25:17,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 267 events. 60/267 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1192 event pairs, 6 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 205. Up to 32 conditions per place. [2025-03-08 17:25:17,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 120 transitions, 280 flow [2025-03-08 17:25:17,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 120 transitions, 280 flow [2025-03-08 17:25:17,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:25:17,593 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;@404ebf62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:25:17,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 17:25:17,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:25:17,595 INFO L124 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-03-08 17:25:17,596 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:25:17,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:17,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:17,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash -412649205, now seen corresponding path program 1 times [2025-03-08 17:25:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838457844] [2025-03-08 17:25:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:17,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:25:17,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:25:17,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:17,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:17,638 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-08 17:25:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838457844] [2025-03-08 17:25:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838457844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:17,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:17,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:25:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630610194] [2025-03-08 17:25:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:25:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:25:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:25:17,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 120 [2025-03-08 17:25:17,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 120 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-08 17:25:17,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:17,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 120 [2025-03-08 17:25:17,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand