./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:26:21,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:26:21,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:26:21,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:26:21,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:26:21,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:26:21,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:26:21,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:26:21,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:26:21,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:26:21,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:26:21,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:26:21,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:26:21,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:26:21,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:26:21,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:26:21,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:26:21,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:26:21,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:26:21,585 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-03-08 17:26:21,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:26:21,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:26:21,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:26:21,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:26:21,819 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:26:21,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-08 17:26:22,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a700650/755ccb1b6d88459c87985235262f0503/FLAG0f3b3496f [2025-03-08 17:26:23,213 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:26:23,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-08 17:26:23,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a700650/755ccb1b6d88459c87985235262f0503/FLAG0f3b3496f [2025-03-08 17:26:23,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a700650/755ccb1b6d88459c87985235262f0503 [2025-03-08 17:26:23,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:26:23,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:26:23,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:26:23,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:26:23,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:26:23,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a17b4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23, skipping insertion in model container [2025-03-08 17:26:23,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:26:23,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-03-08 17:26:23,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:26:23,845 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:26:23,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-03-08 17:26:23,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:26:23,916 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:26:23,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23 WrapperNode [2025-03-08 17:26:23,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:26:23,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:26:23,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:26:23,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:26:23,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,950 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 252 [2025-03-08 17:26:23,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:26:23,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:26:23,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:26:23,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:26:23,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,969 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 70, 5, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 5, 0]. The 5 writes are split as follows [0, 4, 0, 1]. [2025-03-08 17:26:23,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:26:23,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:26:23,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:26:23,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:26:23,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (1/1) ... [2025-03-08 17:26:23,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:26:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:26:24,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:26:24,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:26:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:26:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 17:26:24,036 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:26:24,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:26:24,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:26:24,038 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:26:24,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:26:24,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:26:24,400 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 17:26:24,400 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 17:26:24,468 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:26:24,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:26:24,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:26:24,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:26:24,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:26:24 BoogieIcfgContainer [2025-03-08 17:26:24,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:26:24,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:26:24,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:26:24,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:26:24,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:26:23" (1/3) ... [2025-03-08 17:26:24,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2425275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:26:24, skipping insertion in model container [2025-03-08 17:26:24,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:23" (2/3) ... [2025-03-08 17:26:24,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2425275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:26:24, skipping insertion in model container [2025-03-08 17:26:24,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:26:24" (3/3) ... [2025-03-08 17:26:24,744 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-03-08 17:26:24,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:26:24,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 67 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-08 17:26:24,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:26:24,799 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:26:24,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 95 transitions, 197 flow [2025-03-08 17:26:24,873 INFO L124 PetriNetUnfolderBase]: 41/140 cut-off events. [2025-03-08 17:26:24,875 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:26:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 41/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 509 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 88. Up to 8 conditions per place. [2025-03-08 17:26:24,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 95 transitions, 197 flow [2025-03-08 17:26:24,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 93 transitions, 190 flow [2025-03-08 17:26:24,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:26:24,901 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;@29e14a4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:26:24,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:26:24,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:26:24,911 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-08 17:26:24,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:26:24,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:24,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-08 17:26:24,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 17:26:24,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash -464630489, now seen corresponding path program 1 times [2025-03-08 17:26:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:24,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796046001] [2025-03-08 17:26:24,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:24,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 17:26:25,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 17:26:25,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:25,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796046001] [2025-03-08 17:26:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796046001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:26:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:26:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:26:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915923397] [2025-03-08 17:26:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:26:25,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:26:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:25,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:26:25,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:26:25,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2025-03-08 17:26:25,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 93 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:25,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:25,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2025-03-08 17:26:25,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:26:25,498 INFO L124 PetriNetUnfolderBase]: 481/1302 cut-off events. [2025-03-08 17:26:25,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:26:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 1302 events. 481/1302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8233 event pairs, 396 based on Foata normal form. 249/1382 useless extension candidates. Maximal degree in co-relation 2139. Up to 905 conditions per place. [2025-03-08 17:26:25,506 INFO L140 encePairwiseOnDemand]: 70/95 looper letters, 45 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-08 17:26:25,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 242 flow [2025-03-08 17:26:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:26:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:26:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-03-08 17:26:25,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-03-08 17:26:25,518 INFO L175 Difference]: Start difference. First operand has 69 places, 93 transitions, 190 flow. Second operand 3 states and 145 transitions. [2025-03-08 17:26:25,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 242 flow [2025-03-08 17:26:25,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:26:25,524 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 158 flow [2025-03-08 17:26:25,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2025-03-08 17:26:25,530 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 3 predicate places. [2025-03-08 17:26:25,531 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 158 flow [2025-03-08 17:26:25,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:25,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:25,532 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 17:26:25,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:26:25,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 17:26:25,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1595148636, now seen corresponding path program 1 times [2025-03-08 17:26:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723520798] [2025-03-08 17:26:25,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:25,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:26:25,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:26:25,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:25,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723520798] [2025-03-08 17:26:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723520798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:26:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221570203] [2025-03-08 17:26:25,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:25,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:26:25,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:26:25,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:26:25,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:26:25,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:26:25,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:25,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:25,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:26:25,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:26:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:25,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:26:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221570203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:26:25,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:26:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-08 17:26:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690380163] [2025-03-08 17:26:25,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:26:25,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:26:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:25,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:26:25,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:26:25,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2025-03-08 17:26:25,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:25,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:25,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2025-03-08 17:26:25,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:26:26,005 INFO L124 PetriNetUnfolderBase]: 481/1305 cut-off events. [2025-03-08 17:26:26,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:26:26,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 1305 events. 481/1305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8238 event pairs, 396 based on Foata normal form. 0/1136 useless extension candidates. Maximal degree in co-relation 2216. Up to 905 conditions per place. [2025-03-08 17:26:26,011 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 45 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-08 17:26:26,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 270 flow [2025-03-08 17:26:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:26:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:26:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-08 17:26:26,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.356140350877193 [2025-03-08 17:26:26,014 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 158 flow. Second operand 6 states and 203 transitions. [2025-03-08 17:26:26,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 270 flow [2025-03-08 17:26:26,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 266 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:26:26,015 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 190 flow [2025-03-08 17:26:26,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-08 17:26:26,016 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2025-03-08 17:26:26,016 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 190 flow [2025-03-08 17:26:26,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:26,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:26,016 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-08 17:26:26,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:26:26,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:26,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 17:26:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1173762663, now seen corresponding path program 2 times [2025-03-08 17:26:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:26,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135123512] [2025-03-08 17:26:26,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:26:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:26,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 17:26:26,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:26:26,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:26:26,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135123512] [2025-03-08 17:26:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135123512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:26:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577340388] [2025-03-08 17:26:26,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:26:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:26:26,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:26:26,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:26:26,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 17:26:26,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:26:26,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:26:26,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:26,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:26:26,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:26:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:26,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:26:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577340388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:26:26,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:26:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-08 17:26:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807299306] [2025-03-08 17:26:26,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:26:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:26:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:26,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:26:26,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:26:26,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2025-03-08 17:26:26,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 190 flow. Second operand has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:26,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:26,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2025-03-08 17:26:26,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:26:26,797 INFO L124 PetriNetUnfolderBase]: 481/1311 cut-off events. [2025-03-08 17:26:26,798 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-08 17:26:26,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2265 conditions, 1311 events. 481/1311 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8232 event pairs, 396 based on Foata normal form. 6/1149 useless extension candidates. Maximal degree in co-relation 2207. Up to 905 conditions per place. [2025-03-08 17:26:26,803 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 45 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-03-08 17:26:26,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 81 transitions, 338 flow [2025-03-08 17:26:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:26:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:26:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2025-03-08 17:26:26,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3175438596491228 [2025-03-08 17:26:26,806 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 190 flow. Second operand 12 states and 362 transitions. [2025-03-08 17:26:26,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 81 transitions, 338 flow [2025-03-08 17:26:26,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 324 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-08 17:26:26,808 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 260 flow [2025-03-08 17:26:26,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=260, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-03-08 17:26:26,809 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places. [2025-03-08 17:26:26,809 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 260 flow [2025-03-08 17:26:26,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:26,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:26,809 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-03-08 17:26:26,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:26:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 17:26:27,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 17:26:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1228955207, now seen corresponding path program 3 times [2025-03-08 17:26:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764731501] [2025-03-08 17:26:27,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:26:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:27,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-08 17:26:27,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 17:26:27,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 17:26:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:26:27,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:26:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 17:26:27,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 17:26:27,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:27,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:26:27,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:26:27,095 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:26:27,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-08 17:26:27,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-08 17:26:27,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-08 17:26:27,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-08 17:26:27,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:26:27,100 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-08 17:26:27,102 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:26:27,102 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:26:27,138 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:26:27,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 139 transitions, 294 flow [2025-03-08 17:26:27,161 INFO L124 PetriNetUnfolderBase]: 69/236 cut-off events. [2025-03-08 17:26:27,162 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:26:27,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 236 events. 69/236 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1094 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 142. Up to 12 conditions per place. [2025-03-08 17:26:27,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 139 transitions, 294 flow [2025-03-08 17:26:27,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 139 transitions, 294 flow [2025-03-08 17:26:27,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:26:27,167 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;@29e14a4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:26:27,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:26:27,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:26:27,173 INFO L124 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-03-08 17:26:27,173 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:26:27,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:27,173 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-08 17:26:27,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:26:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 474841084, now seen corresponding path program 1 times [2025-03-08 17:26:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153540299] [2025-03-08 17:26:27,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:26:27,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:26:27,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:27,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153540299] [2025-03-08 17:26:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153540299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:26:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:26:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:26:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227759517] [2025-03-08 17:26:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:26:27,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:26:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:27,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:26:27,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:26:27,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 139 [2025-03-08 17:26:27,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 139 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:27,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:27,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 139 [2025-03-08 17:26:27,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:26:29,417 INFO L124 PetriNetUnfolderBase]: 18446/35553 cut-off events. [2025-03-08 17:26:29,417 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-08 17:26:29,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62113 conditions, 35553 events. 18446/35553 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 327588 event pairs, 15876 based on Foata normal form. 7459/38506 useless extension candidates. Maximal degree in co-relation 50377. Up to 26457 conditions per place. [2025-03-08 17:26:29,575 INFO L140 encePairwiseOnDemand]: 103/139 looper letters, 68 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-08 17:26:29,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 370 flow [2025-03-08 17:26:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:26:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:26:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-03-08 17:26:29,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155875299760192 [2025-03-08 17:26:29,577 INFO L175 Difference]: Start difference. First operand has 102 places, 139 transitions, 294 flow. Second operand 3 states and 215 transitions. [2025-03-08 17:26:29,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 370 flow [2025-03-08 17:26:29,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 107 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:26:29,579 INFO L231 Difference]: Finished difference. Result has 105 places, 107 transitions, 240 flow [2025-03-08 17:26:29,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2025-03-08 17:26:29,580 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2025-03-08 17:26:29,580 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 240 flow [2025-03-08 17:26:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:29,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:29,580 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 17:26:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:26:29,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:26:29,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash 488860274, now seen corresponding path program 1 times [2025-03-08 17:26:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931274993] [2025-03-08 17:26:29,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:29,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:26:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:26:29,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:29,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931274993] [2025-03-08 17:26:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931274993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:26:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331400889] [2025-03-08 17:26:29,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:29,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:26:29,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:26:29,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:26:29,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:26:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:26:29,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:29,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:29,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:26:29,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:26:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:29,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:26:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331400889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:26:29,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:26:29,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-08 17:26:29,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48845125] [2025-03-08 17:26:29,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:26:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:26:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:29,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:26:29,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:26:29,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 139 [2025-03-08 17:26:29,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:29,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:29,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 139 [2025-03-08 17:26:29,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:26:31,455 INFO L124 PetriNetUnfolderBase]: 18446/35556 cut-off events. [2025-03-08 17:26:31,456 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-08 17:26:31,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62129 conditions, 35556 events. 18446/35556 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 327480 event pairs, 15876 based on Foata normal form. 0/31050 useless extension candidates. Maximal degree in co-relation 62116. Up to 26457 conditions per place. [2025-03-08 17:26:31,644 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 68 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-08 17:26:31,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 398 flow [2025-03-08 17:26:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:26:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:26:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2025-03-08 17:26:31,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35731414868105515 [2025-03-08 17:26:31,646 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 240 flow. Second operand 6 states and 298 transitions. [2025-03-08 17:26:31,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 398 flow [2025-03-08 17:26:31,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:26:31,649 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 272 flow [2025-03-08 17:26:31,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2025-03-08 17:26:31,652 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2025-03-08 17:26:31,652 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 272 flow [2025-03-08 17:26:31,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:31,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:31,653 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-08 17:26:31,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:26:31,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:31,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:26:31,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1750110852, now seen corresponding path program 2 times [2025-03-08 17:26:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:31,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690510675] [2025-03-08 17:26:31,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:26:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:31,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 17:26:31,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:26:31,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:26:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690510675] [2025-03-08 17:26:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690510675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:26:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048060497] [2025-03-08 17:26:31,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:26:31,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:26:31,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:26:31,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:26:32,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 17:26:32,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:26:32,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:26:32,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:32,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:26:32,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:26:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:32,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:26:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048060497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:26:32,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:26:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-08 17:26:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728148137] [2025-03-08 17:26:32,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:26:32,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:26:32,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:32,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:26:32,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:26:32,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 139 [2025-03-08 17:26:32,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 272 flow. Second operand has 13 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:32,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:32,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 139 [2025-03-08 17:26:32,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:26:33,846 INFO L124 PetriNetUnfolderBase]: 18446/35562 cut-off events. [2025-03-08 17:26:33,846 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-03-08 17:26:33,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62166 conditions, 35562 events. 18446/35562 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 327543 event pairs, 15876 based on Foata normal form. 6/31063 useless extension candidates. Maximal degree in co-relation 62107. Up to 26457 conditions per place. [2025-03-08 17:26:34,029 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 68 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-08 17:26:34,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 116 transitions, 466 flow [2025-03-08 17:26:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:26:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:26:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 529 transitions. [2025-03-08 17:26:34,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31714628297362113 [2025-03-08 17:26:34,031 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 272 flow. Second operand 12 states and 529 transitions. [2025-03-08 17:26:34,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 116 transitions, 466 flow [2025-03-08 17:26:34,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 116 transitions, 452 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-08 17:26:34,034 INFO L231 Difference]: Finished difference. Result has 128 places, 116 transitions, 342 flow [2025-03-08 17:26:34,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=342, PETRI_PLACES=128, PETRI_TRANSITIONS=116} [2025-03-08 17:26:34,034 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 26 predicate places. [2025-03-08 17:26:34,034 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 342 flow [2025-03-08 17:26:34,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:34,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:34,035 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-03-08 17:26:34,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:26:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:26:34,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:26:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1472124484, now seen corresponding path program 3 times [2025-03-08 17:26:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380836817] [2025-03-08 17:26:34,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:26:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:34,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-08 17:26:34,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:26:34,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 17:26:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:26:34,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:26:34,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:26:34,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:26:34,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:34,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:26:34,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:26:34,309 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:26:34,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-08 17:26:34,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-08 17:26:34,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-08 17:26:34,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-08 17:26:34,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-08 17:26:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:26:34,311 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-08 17:26:34,311 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:26:34,311 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 17:26:34,334 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:26:34,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 183 transitions, 393 flow [2025-03-08 17:26:34,351 INFO L124 PetriNetUnfolderBase]: 100/343 cut-off events. [2025-03-08 17:26:34,351 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 17:26:34,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 343 events. 100/343 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1742 event pairs, 1 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 245. Up to 16 conditions per place. [2025-03-08 17:26:34,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 183 transitions, 393 flow [2025-03-08 17:26:34,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 183 transitions, 393 flow [2025-03-08 17:26:34,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:26:34,357 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;@29e14a4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:26:34,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 17:26:34,361 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:26:34,362 INFO L124 PetriNetUnfolderBase]: 21/112 cut-off events. [2025-03-08 17:26:34,362 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 17:26:34,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:26:34,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:26:34,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:26:34,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:26:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1745203930, now seen corresponding path program 1 times [2025-03-08 17:26:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:26:34,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836141899] [2025-03-08 17:26:34,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:26:34,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:26:34,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:26:34,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:26:34,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:26:34,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:26:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:26:34,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:26:34,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836141899] [2025-03-08 17:26:34,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836141899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:26:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:26:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:26:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083831143] [2025-03-08 17:26:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:26:34,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:26:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:26:34,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:26:34,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:26:34,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 183 [2025-03-08 17:26:34,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 183 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:26:34,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:26:34,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 183 [2025-03-08 17:26:34,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand