./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.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_11-ptr_racing.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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:34:34,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:34:34,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:34:34,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:34:34,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:34:34,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:34:34,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:34:34,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:34:34,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:34:34,612 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:34:34,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:34:34,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:34:34,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:34:34,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:34:34,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:34:34,614 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:34:34,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:34:34,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:34:34,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:34:34,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:34:34,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:34:34,616 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2025-01-09 16:34:34,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:34:34,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:34:34,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:34:34,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:34:34,825 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:34:34,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_11-ptr_racing.i [2025-01-09 16:34:35,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85d397d96/2a62867a0d68440382d9cc4fa965745d/FLAGdece6fa56 [2025-01-09 16:34:36,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:34:36,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-01-09 16:34:36,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85d397d96/2a62867a0d68440382d9cc4fa965745d/FLAGdece6fa56 [2025-01-09 16:34:36,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85d397d96/2a62867a0d68440382d9cc4fa965745d [2025-01-09 16:34:36,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:34:36,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:34:36,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:34:36,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:34:36,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:34:36,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:34:36" (1/1) ... [2025-01-09 16:34:36,383 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 09.01 04:34:36, skipping insertion in model container [2025-01-09 16:34:36,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:34:36" (1/1) ... [2025-01-09 16:34:36,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:34:36,584 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_11-ptr_racing.i[30176,30189] [2025-01-09 16:34:36,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:34:36,606 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:34:36,636 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_11-ptr_racing.i[30176,30189] [2025-01-09 16:34:36,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:34:36,681 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:34:36,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:36 WrapperNode [2025-01-09 16:34:36,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:34:36,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:34:36,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:34:36,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:34:36,686 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:36" (1/1) ... [2025-01-09 16:34:36,701 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:36" (1/1) ... [2025-01-09 16:34:36,711 INFO L138 Inliner]: procedures = 171, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-01-09 16:34:36,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:34:36,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:34:36,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:34:36,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:34:36,717 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:36" (1/1) ... [2025-01-09 16:34:36,717 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:36" (1/1) ... [2025-01-09 16:34:36,722 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:36" (1/1) ... [2025-01-09 16:34:36,739 INFO L175 MemorySlicer]: Split 25 memory accesses to 6 slices as follows [2, 5, 5, 5, 2, 6]. 24 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 0, 1]. The 3 writes are split as follows [0, 0, 0, 0, 1, 2]. [2025-01-09 16:34:36,739 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:36" (1/1) ... [2025-01-09 16:34:36,739 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:36" (1/1) ... [2025-01-09 16:34:36,747 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:36" (1/1) ... [2025-01-09 16:34:36,747 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:36" (1/1) ... [2025-01-09 16:34:36,752 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:36" (1/1) ... [2025-01-09 16:34:36,753 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:36" (1/1) ... [2025-01-09 16:34:36,754 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:36" (1/1) ... [2025-01-09 16:34:36,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:34:36,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:34:36,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:34:36,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:34:36,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:36" (1/1) ... [2025-01-09 16:34:36,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:34:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:34:36,786 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:36,791 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:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:34:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 16:34:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:34:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:34:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 16:34:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 16:34:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:34:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:34:36,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:34:36,806 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:36,890 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:34:36,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:34:37,111 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:34:37,111 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:34:37,254 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:34:37,254 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 16:34:37,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:34:37 BoogieIcfgContainer [2025-01-09 16:34:37,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:34:37,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:34:37,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:34:37,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:34:37,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:34:36" (1/3) ... [2025-01-09 16:34:37,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbfe1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:34:37, skipping insertion in model container [2025-01-09 16:34:37,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:34:36" (2/3) ... [2025-01-09 16:34:37,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbfe1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:34:37, skipping insertion in model container [2025-01-09 16:34:37,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:34:37" (3/3) ... [2025-01-09 16:34:37,263 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-01-09 16:34:37,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:34:37,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 39 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:34:37,275 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:34:37,310 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:34:37,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 49 transitions, 105 flow [2025-01-09 16:34:37,385 INFO L124 PetriNetUnfolderBase]: 13/69 cut-off events. [2025-01-09 16:34:37,390 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:34:37,392 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 218 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:37,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 49 transitions, 105 flow [2025-01-09 16:34:37,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 47 transitions, 98 flow [2025-01-09 16:34:37,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:37,417 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;@5f9fc3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:37,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:37,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:37,427 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 16:34:37,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:34:37,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:37,428 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:34:37,428 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:37,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1633964801, now seen corresponding path program 1 times [2025-01-09 16:34:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325821173] [2025-01-09 16:34:37,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:34:37,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:34:37,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:37,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:37,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:37,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:34:37,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:34:37,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:37,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:37,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:37,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:37,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-09 16:34:37,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 16:34:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:34:37,592 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:34:37,594 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:34:37,596 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:34:37,614 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:34:37,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 74 transitions, 164 flow [2025-01-09 16:34:37,641 INFO L124 PetriNetUnfolderBase]: 24/121 cut-off events. [2025-01-09 16:34:37,641 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:34:37,645 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 12. Compared 481 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:37,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 74 transitions, 164 flow [2025-01-09 16:34:37,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 74 transitions, 164 flow [2025-01-09 16:34:37,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:37,648 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f9fc3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:37,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:37,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:37,659 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:34:37,659 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:34:37,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:37,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:37,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:37,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1151411145, now seen corresponding path program 1 times [2025-01-09 16:34:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:37,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68358217] [2025-01-09 16:34:37,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:37,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:34:37,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:34:37,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:37,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:37,774 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:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:37,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68358217] [2025-01-09 16:34:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68358217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:37,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305761977] [2025-01-09 16:34:37,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:37,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:34:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:37,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:34:37,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:34:37,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 74 [2025-01-09 16:34:37,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 164 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-01-09 16:34:37,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:37,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 74 [2025-01-09 16:34:37,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:38,450 INFO L124 PetriNetUnfolderBase]: 2932/5765 cut-off events. [2025-01-09 16:34:38,451 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-01-09 16:34:38,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10537 conditions, 5765 events. 2932/5765 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 40618 event pairs, 2600 based on Foata normal form. 1412/6754 useless extension candidates. Maximal degree in co-relation 7065. Up to 4697 conditions per place. [2025-01-09 16:34:38,479 INFO L140 encePairwiseOnDemand]: 56/74 looper letters, 39 selfloop transitions, 2 changer transitions 11/71 dead transitions. [2025-01-09 16:34:38,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 258 flow [2025-01-09 16:34:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:34:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:34:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-01-09 16:34:38,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-01-09 16:34:38,491 INFO L175 Difference]: Start difference. First operand has 62 places, 74 transitions, 164 flow. Second operand 3 states and 135 transitions. [2025-01-09 16:34:38,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 258 flow [2025-01-09 16:34:38,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:38,504 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 118 flow [2025-01-09 16:34:38,506 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:38,509 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-01-09 16:34:38,509 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 118 flow [2025-01-09 16:34:38,510 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-01-09 16:34:38,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:38,510 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:34:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:34:38,511 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:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 176070825, now seen corresponding path program 1 times [2025-01-09 16:34:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:38,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613242836] [2025-01-09 16:34:38,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:38,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:34:38,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:34:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:38,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:38,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:34:38,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:34:38,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:38,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:38,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:38,581 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:38,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-09 16:34:38,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 16:34:38,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:34:38,583 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:34:38,584 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:34:38,584 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:34:38,611 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:34:38,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 99 transitions, 225 flow [2025-01-09 16:34:38,639 INFO L124 PetriNetUnfolderBase]: 38/184 cut-off events. [2025-01-09 16:34:38,640 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:34:38,641 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 789 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:38,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 99 transitions, 225 flow [2025-01-09 16:34:38,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 99 transitions, 225 flow [2025-01-09 16:34:38,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:38,645 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;@5f9fc3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:38,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:38,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:38,650 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:34:38,650 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:34:38,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:38,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:38,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1806711479, now seen corresponding path program 1 times [2025-01-09 16:34:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179424827] [2025-01-09 16:34:38,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:38,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:34:38,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:34:38,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:38,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:38,710 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:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179424827] [2025-01-09 16:34:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179424827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:38,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164698405] [2025-01-09 16:34:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:38,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:34:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:38,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:34:38,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:34:38,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 99 [2025-01-09 16:34:38,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 225 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-01-09 16:34:38,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:38,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 99 [2025-01-09 16:34:38,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:44,076 INFO L124 PetriNetUnfolderBase]: 51087/83318 cut-off events. [2025-01-09 16:34:44,077 INFO L125 PetriNetUnfolderBase]: For 1325/1325 co-relation queries the response was YES. [2025-01-09 16:34:44,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155574 conditions, 83318 events. 51087/83318 cut-off events. For 1325/1325 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 712037 event pairs, 47355 based on Foata normal form. 22878/101093 useless extension candidates. Maximal degree in co-relation 75615. Up to 71288 conditions per place. [2025-01-09 16:34:44,443 INFO L140 encePairwiseOnDemand]: 75/99 looper letters, 50 selfloop transitions, 2 changer transitions 12/90 dead transitions. [2025-01-09 16:34:44,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 331 flow [2025-01-09 16:34:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:34:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:34:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-01-09 16:34:44,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-01-09 16:34:44,446 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 225 flow. Second operand 3 states and 174 transitions. [2025-01-09 16:34:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 331 flow [2025-01-09 16:34:44,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:44,452 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 162 flow [2025-01-09 16:34:44,452 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:44,453 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2025-01-09 16:34:44,453 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 162 flow [2025-01-09 16:34:44,453 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-01-09 16:34:44,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:44,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:44,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:34:44,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash 409808396, now seen corresponding path program 1 times [2025-01-09 16:34:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085476644] [2025-01-09 16:34:44,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:34:44,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:34:44,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:44,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:44,515 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:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085476644] [2025-01-09 16:34:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085476644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:34:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669710976] [2025-01-09 16:34:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:44,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:34:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:44,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:34:44,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:34:44,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 99 [2025-01-09 16:34:44,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 162 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-01-09 16:34:44,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:44,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 99 [2025-01-09 16:34:44,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:47,074 INFO L124 PetriNetUnfolderBase]: 25650/43204 cut-off events. [2025-01-09 16:34:47,074 INFO L125 PetriNetUnfolderBase]: For 3519/3519 co-relation queries the response was YES. [2025-01-09 16:34:47,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82506 conditions, 43204 events. 25650/43204 cut-off events. For 3519/3519 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 359931 event pairs, 14476 based on Foata normal form. 11/42430 useless extension candidates. Maximal degree in co-relation 7664. Up to 35564 conditions per place. [2025-01-09 16:34:47,397 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 71 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2025-01-09 16:34:47,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 378 flow [2025-01-09 16:34:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:34:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:34:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-01-09 16:34:47,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-01-09 16:34:47,404 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 162 flow. Second operand 4 states and 187 transitions. [2025-01-09 16:34:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 378 flow [2025-01-09 16:34:47,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:34:47,406 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 174 flow [2025-01-09 16:34:47,408 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:47,409 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -3 predicate places. [2025-01-09 16:34:47,409 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 174 flow [2025-01-09 16:34:47,410 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-01-09 16:34:47,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:47,410 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:34:47,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:34:47,410 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:47,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1512810944, now seen corresponding path program 1 times [2025-01-09 16:34:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:47,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847256640] [2025-01-09 16:34:47,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:47,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:34:47,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:34:47,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:47,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:34:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:34:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:47,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:47,460 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:47,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-09 16:34:47,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 16:34:47,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:34:47,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:34:47,461 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:34:47,461 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:34:47,484 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:34:47,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 124 transitions, 288 flow [2025-01-09 16:34:47,499 INFO L124 PetriNetUnfolderBase]: 60/271 cut-off events. [2025-01-09 16:34:47,500 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 16:34:47,501 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 1250 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:47,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 124 transitions, 288 flow [2025-01-09 16:34:47,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 124 transitions, 288 flow [2025-01-09 16:34:47,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:34:47,503 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;@5f9fc3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:34:47,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 16:34:47,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:34:47,506 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:34:47,506 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:34:47,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:47,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:47,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:34:47,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1603060553, now seen corresponding path program 1 times [2025-01-09 16:34:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320289198] [2025-01-09 16:34:47,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:47,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:34:47,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:34:47,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:47,549 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:47,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:47,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320289198] [2025-01-09 16:34:47,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320289198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:47,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203559335] [2025-01-09 16:34:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:47,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:34:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:47,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:34:47,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:34:47,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2025-01-09 16:34:47,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 124 transitions, 288 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-01-09 16:34:47,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2025-01-09 16:34:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand