./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:33:59,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:33:59,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:33:59,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:33:59,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:33:59,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:33:59,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:33:59,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:33:59,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:33:59,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:33:59,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:33:59,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:33:59,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:33:59,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:33:59,616 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:33:59,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:33:59,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:33:59,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:59,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:59,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:59,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:33:59,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:33:59,620 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-jdk21/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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-01-09 16:33:59,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:33:59,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:33:59,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:33:59,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:33:59,825 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:33:59,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-01-09 16:34:00,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f54329e1/65f23a16974f4feebbe091d277d023cc/FLAGd72436148 [2025-01-09 16:34:01,288 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:34:01,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-01-09 16:34:01,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f54329e1/65f23a16974f4feebbe091d277d023cc/FLAGd72436148 [2025-01-09 16:34:01,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f54329e1/65f23a16974f4feebbe091d277d023cc [2025-01-09 16:34:01,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:34:01,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:34:01,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:34:01,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:34:01,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:34:01,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01, skipping insertion in model container [2025-01-09 16:34:01,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:34:01,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i[30176,30189] [2025-01-09 16:34:01,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:34:01,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:34:01,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i[30176,30189] [2025-01-09 16:34:01,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:34:01,663 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:34:01,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01 WrapperNode [2025-01-09 16:34:01,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:34:01,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:34:01,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:34:01,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:34:01,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,700 INFO L138 Inliner]: procedures = 171, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2025-01-09 16:34:01,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:34:01,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:34:01,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:34:01,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:34:01,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,735 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-01-09 16:34:01,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:34:01,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:34:01,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:34:01,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:34:01,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (1/1) ... [2025-01-09 16:34:01,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:34:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:34:01,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:34:01,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:34:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:34:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 16:34:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:34:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:34:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:34:01,812 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:34:01,923 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:34:01,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:34:02,122 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:34:02,123 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:34:02,432 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:34:02,434 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 16:34:02,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:34:02 BoogieIcfgContainer [2025-01-09 16:34:02,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:34:02,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:34:02,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:34:02,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:34:02,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:34:01" (1/3) ... [2025-01-09 16:34:02,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a77ed68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:34:02, skipping insertion in model container [2025-01-09 16:34:02,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:01" (2/3) ... [2025-01-09 16:34:02,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a77ed68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:34:02, skipping insertion in model container [2025-01-09 16:34:02,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:34:02" (3/3) ... [2025-01-09 16:34:02,442 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-01-09 16:34:02,452 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:34:02,454 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 39 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:34:02,454 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:34:02,490 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:34:02,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 49 transitions, 105 flow [2025-01-09 16:34:02,553 INFO L124 PetriNetUnfolderBase]: 13/69 cut-off events. [2025-01-09 16:34:02,555 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:34:02,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 69 events. 13/69 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 219 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2025-01-09 16:34:02,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 49 transitions, 105 flow [2025-01-09 16:34:02,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 47 transitions, 98 flow [2025-01-09 16:34:02,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:02,581 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;@57067400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:02,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:02,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:02,590 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 16:34:02,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:34:02,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:02,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:34:02,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -89250380, now seen corresponding path program 1 times [2025-01-09 16:34:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202788762] [2025-01-09 16:34:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:02,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:34:02,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:34:02,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:02,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:34:02,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:34:02,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:02,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:02,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:02,813 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:02,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-09 16:34:02,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 16:34:02,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:34:02,816 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:34:02,821 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:34:02,821 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:34:02,839 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:34:02,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 74 transitions, 164 flow [2025-01-09 16:34:02,870 INFO L124 PetriNetUnfolderBase]: 24/121 cut-off events. [2025-01-09 16:34:02,870 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:34:02,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 121 events. 24/121 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 476 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2025-01-09 16:34:02,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 74 transitions, 164 flow [2025-01-09 16:34:02,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 74 transitions, 164 flow [2025-01-09 16:34:02,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:02,876 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;@57067400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:02,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:02,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:02,890 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:34:02,890 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:34:02,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:02,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:02,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:02,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1371317166, now seen corresponding path program 1 times [2025-01-09 16:34:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:02,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845635704] [2025-01-09 16:34:02,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:02,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:34:02,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:34:02,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:02,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:34:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845635704] [2025-01-09 16:34:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845635704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360294191] [2025-01-09 16:34:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:03,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:34:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:03,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:34:03,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:34:03,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2025-01-09 16:34:03,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-01-09 16:34:03,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:03,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2025-01-09 16:34:03,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:03,628 INFO L124 PetriNetUnfolderBase]: 2414/4780 cut-off events. [2025-01-09 16:34:03,629 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-09 16:34:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 4780 events. 2414/4780 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 33901 event pairs, 2394 based on Foata normal form. 1265/5685 useless extension candidates. Maximal degree in co-relation 6402. Up to 3889 conditions per place. [2025-01-09 16:34:03,656 INFO L140 encePairwiseOnDemand]: 56/74 looper letters, 36 selfloop transitions, 2 changer transitions 11/70 dead transitions. [2025-01-09 16:34:03,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 250 flow [2025-01-09 16:34:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:34:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:34:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-09 16:34:03,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-01-09 16:34:03,673 INFO L175 Difference]: Start difference. First operand has 62 places, 74 transitions, 164 flow. Second operand 3 states and 138 transitions. [2025-01-09 16:34:03,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 250 flow [2025-01-09 16:34:03,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:03,680 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 118 flow [2025-01-09 16:34:03,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2025-01-09 16:34:03,683 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-01-09 16:34:03,684 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 118 flow [2025-01-09 16:34:03,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-01-09 16:34:03,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:03,684 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:34:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:34:03,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:03,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1616776573, now seen corresponding path program 1 times [2025-01-09 16:34:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-01-09 16:34:03,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:03,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:34:03,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:34:03,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:03,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:03,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:34:03,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:34:03,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:03,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:03,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:03,762 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:03,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-09 16:34:03,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 16:34:03,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:34:03,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:34:03,764 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:34:03,764 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:34:03,790 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:34:03,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 99 transitions, 225 flow [2025-01-09 16:34:03,813 INFO L124 PetriNetUnfolderBase]: 38/184 cut-off events. [2025-01-09 16:34:03,813 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:34:03,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 184 events. 38/184 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 791 event pairs, 1 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 132. Up to 12 conditions per place. [2025-01-09 16:34:03,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 99 transitions, 225 flow [2025-01-09 16:34:03,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 99 transitions, 225 flow [2025-01-09 16:34:03,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:03,818 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;@57067400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:03,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:03,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:03,823 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:34:03,823 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:34:03,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:03,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:03,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:03,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash -34472494, now seen corresponding path program 1 times [2025-01-09 16:34:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:03,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417465964] [2025-01-09 16:34:03,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:03,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:34:03,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:34:03,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:03,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:34:03,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417465964] [2025-01-09 16:34:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417465964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:03,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:03,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:03,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371448153] [2025-01-09 16:34:03,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:03,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:34:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:03,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:34:03,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:34:03,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 99 [2025-01-09 16:34:03,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-01-09 16:34:03,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:03,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 99 [2025-01-09 16:34:03,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:07,725 INFO L124 PetriNetUnfolderBase]: 38401/62918 cut-off events. [2025-01-09 16:34:07,725 INFO L125 PetriNetUnfolderBase]: For 1137/1137 co-relation queries the response was YES. [2025-01-09 16:34:07,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117545 conditions, 62918 events. 38401/62918 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 1620. Compared 539081 event pairs, 36768 based on Foata normal form. 19074/78040 useless extension candidates. Maximal degree in co-relation 68573. Up to 53816 conditions per place. [2025-01-09 16:34:07,942 INFO L140 encePairwiseOnDemand]: 75/99 looper letters, 46 selfloop transitions, 2 changer transitions 12/89 dead transitions. [2025-01-09 16:34:07,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 89 transitions, 321 flow [2025-01-09 16:34:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:34:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:34:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2025-01-09 16:34:07,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026936026936027 [2025-01-09 16:34:07,944 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 225 flow. Second operand 3 states and 179 transitions. [2025-01-09 16:34:07,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 89 transitions, 321 flow [2025-01-09 16:34:07,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:07,947 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 162 flow [2025-01-09 16:34:07,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2025-01-09 16:34:07,947 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2025-01-09 16:34:07,947 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 162 flow [2025-01-09 16:34:07,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-01-09 16:34:07,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:07,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:07,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:34:07,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:07,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1873214582, now seen corresponding path program 1 times [2025-01-09 16:34:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:07,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854095093] [2025-01-09 16:34:07,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:07,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:34:07,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:34:07,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:34:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854095093] [2025-01-09 16:34:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854095093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:34:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671323923] [2025-01-09 16:34:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:08,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:34:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:08,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:34:08,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:34:08,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 99 [2025-01-09 16:34:08,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-01-09 16:34:08,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:08,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 99 [2025-01-09 16:34:08,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:09,529 INFO L124 PetriNetUnfolderBase]: 19188/32438 cut-off events. [2025-01-09 16:34:09,529 INFO L125 PetriNetUnfolderBase]: For 2919/2919 co-relation queries the response was YES. [2025-01-09 16:34:09,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62018 conditions, 32438 events. 19188/32438 cut-off events. For 2919/2919 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 269898 event pairs, 12150 based on Foata normal form. 10/31834 useless extension candidates. Maximal degree in co-relation 6351. Up to 26681 conditions per place. [2025-01-09 16:34:09,673 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 65 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-01-09 16:34:09,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 360 flow [2025-01-09 16:34:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:34:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:34:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-01-09 16:34:09,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48737373737373735 [2025-01-09 16:34:09,675 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 162 flow. Second operand 4 states and 193 transitions. [2025-01-09 16:34:09,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 360 flow [2025-01-09 16:34:09,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 356 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:34:09,677 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 174 flow [2025-01-09 16:34:09,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2025-01-09 16:34:09,681 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -3 predicate places. [2025-01-09 16:34:09,682 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 174 flow [2025-01-09 16:34:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-01-09 16:34:09,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:09,682 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:34:09,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:34:09,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1055987373, now seen corresponding path program 1 times [2025-01-09 16:34:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093419979] [2025-01-09 16:34:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:34:09,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:34:09,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:09,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:09,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:34:09,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:34:09,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:09,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:09,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:09,756 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:09,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-09 16:34:09,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 16:34:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:34:09,758 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:34:09,759 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:34:09,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:34:09,782 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:34:09,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 124 transitions, 288 flow [2025-01-09 16:34:09,799 INFO L124 PetriNetUnfolderBase]: 60/271 cut-off events. [2025-01-09 16:34:09,799 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 16:34:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 271 events. 60/271 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1232 event pairs, 6 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 208. Up to 32 conditions per place. [2025-01-09 16:34:09,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 124 transitions, 288 flow [2025-01-09 16:34:09,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 124 transitions, 288 flow [2025-01-09 16:34:09,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:09,806 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;@57067400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:09,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:09,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:09,810 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:34:09,810 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:34:09,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:09,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:09,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash -919667758, now seen corresponding path program 1 times [2025-01-09 16:34:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-01-09 16:34:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:09,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:34:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:34:09,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:34:09,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-01-09 16:34:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:09,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:09,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709791324] [2025-01-09 16:34:09,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:09,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:34:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:09,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:34:09,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:34:09,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2025-01-09 16:34:09,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 124 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-01-09 16:34:09,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:09,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2025-01-09 16:34:09,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand