./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:23:50,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:23:50,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:23:50,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:23:50,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:23:50,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:23:50,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:23:50,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:23:50,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:23:50,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:23:50,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:23:50,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:23:50,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:23:50,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:23:50,539 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:23:50,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:23:50,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:50,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:50,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:50,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:23:50,541 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-01-09 16:23:50,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:23:50,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:23:50,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:23:50,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:23:50,770 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:23:50,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-01-09 16:23:51,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1f5d5470/edf295e10a9d4930a562e2c6bdbb6e38/FLAGc7310d181 [2025-01-09 16:23:52,087 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:23:52,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-01-09 16:23:52,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1f5d5470/edf295e10a9d4930a562e2c6bdbb6e38/FLAGc7310d181 [2025-01-09 16:23:52,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1f5d5470/edf295e10a9d4930a562e2c6bdbb6e38 [2025-01-09 16:23:52,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:23:52,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:23:52,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:52,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:23:52,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:23:52,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f46a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52, skipping insertion in model container [2025-01-09 16:23:52,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:23:52,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30640,30653] [2025-01-09 16:23:52,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:52,689 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:23:52,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30640,30653] [2025-01-09 16:23:52,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:52,757 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:23:52,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52 WrapperNode [2025-01-09 16:23:52,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:52,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:52,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:23:52,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:23:52,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,783 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-01-09 16:23:52,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:52,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:23:52,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:23:52,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:23:52,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,800 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-01-09 16:23:52,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:23:52,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:23:52,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:23:52,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:23:52,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (1/1) ... [2025-01-09 16:23:52,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:52,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:23:52,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:23:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-09 16:23:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:23:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:23:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:23:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:23:52,857 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:23:52,937 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:23:52,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:23:53,087 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:23:53,088 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:23:53,194 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:23:53,195 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:23:53,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:53 BoogieIcfgContainer [2025-01-09 16:23:53,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:23:53,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:23:53,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:23:53,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:23:53,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:52" (1/3) ... [2025-01-09 16:23:53,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2297999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:53, skipping insertion in model container [2025-01-09 16:23:53,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:52" (2/3) ... [2025-01-09 16:23:53,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2297999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:53, skipping insertion in model container [2025-01-09 16:23:53,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:53" (3/3) ... [2025-01-09 16:23:53,202 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-01-09 16:23:53,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:23:53,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:23:53,215 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:23:53,247 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:53,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 58 flow [2025-01-09 16:23:53,290 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-01-09 16:23:53,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:53,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-01-09 16:23:53,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 58 flow [2025-01-09 16:23:53,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 55 flow [2025-01-09 16:23:53,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:53,309 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;@a1d51ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:53,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:23:53,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:53,314 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-09 16:23:53,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:53,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:53,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:53,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:23:53,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash -840968018, now seen corresponding path program 1 times [2025-01-09 16:23:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046605862] [2025-01-09 16:23:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:53,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:53,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:53,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:53,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046605862] [2025-01-09 16:23:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046605862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795026417] [2025-01-09 16:23:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:53,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:53,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:53,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-01-09 16:23:53,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:53,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:53,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-01-09 16:23:53,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:53,626 INFO L124 PetriNetUnfolderBase]: 158/310 cut-off events. [2025-01-09 16:23:53,626 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:53,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 310 events. 158/310 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1282 event pairs, 50 based on Foata normal form. 9/305 useless extension candidates. Maximal degree in co-relation 571. Up to 134 conditions per place. [2025-01-09 16:23:53,633 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-01-09 16:23:53,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 105 flow [2025-01-09 16:23:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-01-09 16:23:53,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-01-09 16:23:53,651 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 55 flow. Second operand 3 states and 53 transitions. [2025-01-09 16:23:53,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 105 flow [2025-01-09 16:23:53,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:53,657 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 68 flow [2025-01-09 16:23:53,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2025-01-09 16:23:53,664 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-01-09 16:23:53,664 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 68 flow [2025-01-09 16:23:53,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:53,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:53,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:53,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:23:53,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:23:53,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -640705197, now seen corresponding path program 1 times [2025-01-09 16:23:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420351916] [2025-01-09 16:23:53,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:53,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:53,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:53,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:53,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:53,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:53,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:53,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:53,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:53,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:53,739 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:53,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:23:53,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:23:53,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:23:53,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:23:53,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:23:53,743 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:23:53,745 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:53,745 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:23:53,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:53,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 106 flow [2025-01-09 16:23:53,775 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-01-09 16:23:53,775 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:23:53,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 36 events. 4/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2025-01-09 16:23:53,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 106 flow [2025-01-09 16:23:53,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 31 transitions, 75 flow [2025-01-09 16:23:53,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:53,777 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;@a1d51ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:53,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:23:53,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:53,783 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-09 16:23:53,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:53,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:53,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:53,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:23:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash 412408505, now seen corresponding path program 1 times [2025-01-09 16:23:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094261793] [2025-01-09 16:23:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:53,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:53,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094261793] [2025-01-09 16:23:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094261793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695171443] [2025-01-09 16:23:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:53,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:53,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:53,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:53,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-09 16:23:53,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:53,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:53,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-09 16:23:53,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:54,068 INFO L124 PetriNetUnfolderBase]: 1203/1934 cut-off events. [2025-01-09 16:23:54,068 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-09 16:23:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3719 conditions, 1934 events. 1203/1934 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10069 event pairs, 303 based on Foata normal form. 54/1922 useless extension candidates. Maximal degree in co-relation 3708. Up to 1003 conditions per place. [2025-01-09 16:23:54,083 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 25 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-01-09 16:23:54,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 152 flow [2025-01-09 16:23:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-01-09 16:23:54,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-01-09 16:23:54,087 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 3 states and 81 transitions. [2025-01-09 16:23:54,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 152 flow [2025-01-09 16:23:54,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:54,089 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 94 flow [2025-01-09 16:23:54,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-01-09 16:23:54,089 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-01-09 16:23:54,090 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 94 flow [2025-01-09 16:23:54,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:54,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:54,091 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:54,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:23:54,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:23:54,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1120964689, now seen corresponding path program 1 times [2025-01-09 16:23:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:54,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579867647] [2025-01-09 16:23:54,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:54,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:23:54,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:23:54,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:54,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:54,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:23:54,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:23:54,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:54,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:54,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:54,111 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:54,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:23:54,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:23:54,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-09 16:23:54,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:23:54,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:23:54,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:23:54,112 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:23:54,113 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:54,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:23:54,132 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:54,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 61 transitions, 158 flow [2025-01-09 16:23:54,139 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-01-09 16:23:54,140 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:23:54,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 46 events. 5/46 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2025-01-09 16:23:54,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 61 transitions, 158 flow [2025-01-09 16:23:54,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 38 transitions, 97 flow [2025-01-09 16:23:54,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:54,142 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;@a1d51ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:54,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:23:54,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:54,144 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-01-09 16:23:54,144 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:54,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:54,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:54,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:23:54,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash 983941260, now seen corresponding path program 1 times [2025-01-09 16:23:54,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:54,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146783354] [2025-01-09 16:23:54,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:54,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:54,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:54,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:54,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146783354] [2025-01-09 16:23:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146783354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:54,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945229667] [2025-01-09 16:23:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:54,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:54,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:54,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:23:54,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:54,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:54,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:23:54,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:54,790 INFO L124 PetriNetUnfolderBase]: 6995/10083 cut-off events. [2025-01-09 16:23:54,791 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-01-09 16:23:54,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19714 conditions, 10083 events. 6995/10083 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 57702 event pairs, 1712 based on Foata normal form. 243/10027 useless extension candidates. Maximal degree in co-relation 19702. Up to 5767 conditions per place. [2025-01-09 16:23:54,851 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 32 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-01-09 16:23:54,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 203 flow [2025-01-09 16:23:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-09 16:23:54,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5956284153005464 [2025-01-09 16:23:54,853 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 97 flow. Second operand 3 states and 109 transitions. [2025-01-09 16:23:54,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 203 flow [2025-01-09 16:23:54,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 198 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:54,855 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 120 flow [2025-01-09 16:23:54,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-01-09 16:23:54,855 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-01-09 16:23:54,857 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 120 flow [2025-01-09 16:23:54,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:54,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:54,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:54,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:23:54,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:23:54,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2144137738, now seen corresponding path program 1 times [2025-01-09 16:23:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602848933] [2025-01-09 16:23:54,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:54,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:23:54,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:23:54,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:54,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602848933] [2025-01-09 16:23:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602848933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545919890] [2025-01-09 16:23:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:54,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:54,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:23:54,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:54,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:54,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:23:54,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:55,730 INFO L124 PetriNetUnfolderBase]: 9157/13304 cut-off events. [2025-01-09 16:23:55,730 INFO L125 PetriNetUnfolderBase]: For 4334/4334 co-relation queries the response was YES. [2025-01-09 16:23:55,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29932 conditions, 13304 events. 9157/13304 cut-off events. For 4334/4334 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 80661 event pairs, 1070 based on Foata normal form. 135/13365 useless extension candidates. Maximal degree in co-relation 29917. Up to 6256 conditions per place. [2025-01-09 16:23:55,787 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 43 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2025-01-09 16:23:55,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 330 flow [2025-01-09 16:23:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:23:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:23:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-01-09 16:23:55,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2025-01-09 16:23:55,789 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 120 flow. Second operand 4 states and 131 transitions. [2025-01-09 16:23:55,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 330 flow [2025-01-09 16:23:55,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:55,795 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 188 flow [2025-01-09 16:23:55,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-01-09 16:23:55,796 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-09 16:23:55,796 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 188 flow [2025-01-09 16:23:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:55,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:55,796 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:23:55,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:23:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 955761938, now seen corresponding path program 1 times [2025-01-09 16:23:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57300592] [2025-01-09 16:23:55,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:55,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:23:55,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:23:55,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:55,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:55,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:23:55,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:23:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:55,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:55,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:55,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:23:55,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:23:55,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-09 16:23:55,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:23:55,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:23:55,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:23:55,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:23:55,815 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:23:55,815 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:55,815 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:23:55,836 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:55,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 79 transitions, 214 flow [2025-01-09 16:23:55,840 INFO L124 PetriNetUnfolderBase]: 6/56 cut-off events. [2025-01-09 16:23:55,841 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:23:55,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 56 events. 6/56 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 111 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 72. Up to 5 conditions per place. [2025-01-09 16:23:55,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 79 transitions, 214 flow [2025-01-09 16:23:55,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 121 flow [2025-01-09 16:23:55,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:55,842 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;@a1d51ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:55,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:23:55,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:55,843 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-09 16:23:55,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:55,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:55,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:55,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:23:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 892716347, now seen corresponding path program 1 times [2025-01-09 16:23:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:55,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323036070] [2025-01-09 16:23:55,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:55,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:55,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:55,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:55,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323036070] [2025-01-09 16:23:55,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323036070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:55,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:55,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082922394] [2025-01-09 16:23:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:55,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:55,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:55,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:55,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-01-09 16:23:55,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:55,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:55,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-01-09 16:23:55,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:58,164 INFO L124 PetriNetUnfolderBase]: 36336/48833 cut-off events. [2025-01-09 16:23:58,164 INFO L125 PetriNetUnfolderBase]: For 7732/7732 co-relation queries the response was YES. [2025-01-09 16:23:58,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96558 conditions, 48833 events. 36336/48833 cut-off events. For 7732/7732 co-relation queries the response was YES. Maximal size of possible extension queue 1787. Compared 293952 event pairs, 9261 based on Foata normal form. 1008/48584 useless extension candidates. Maximal degree in co-relation 96545. Up to 29392 conditions per place. [2025-01-09 16:23:58,562 INFO L140 encePairwiseOnDemand]: 65/79 looper letters, 39 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-01-09 16:23:58,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 258 flow [2025-01-09 16:23:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-01-09 16:23:58,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780590717299579 [2025-01-09 16:23:58,568 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 121 flow. Second operand 3 states and 137 transitions. [2025-01-09 16:23:58,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 258 flow [2025-01-09 16:23:58,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 245 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:58,571 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 146 flow [2025-01-09 16:23:58,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-01-09 16:23:58,572 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-01-09 16:23:58,572 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 146 flow [2025-01-09 16:23:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:58,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:58,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:58,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:23:58,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:23:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash -326791256, now seen corresponding path program 1 times [2025-01-09 16:23:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:58,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163812485] [2025-01-09 16:23:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:58,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:23:58,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:23:58,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:58,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:58,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163812485] [2025-01-09 16:23:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163812485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:58,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:58,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763713676] [2025-01-09 16:23:58,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:58,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:58,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:58,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-01-09 16:23:58,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:58,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:58,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-01-09 16:23:58,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:01,621 INFO L124 PetriNetUnfolderBase]: 43697/59530 cut-off events. [2025-01-09 16:24:01,622 INFO L125 PetriNetUnfolderBase]: For 19236/19236 co-relation queries the response was YES. [2025-01-09 16:24:01,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134273 conditions, 59530 events. 43697/59530 cut-off events. For 19236/19236 co-relation queries the response was YES. Maximal size of possible extension queue 2373. Compared 378275 event pairs, 5040 based on Foata normal form. 372/59701 useless extension candidates. Maximal degree in co-relation 134257. Up to 31321 conditions per place. [2025-01-09 16:24:01,881 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 52 selfloop transitions, 14 changer transitions 0/79 dead transitions. [2025-01-09 16:24:01,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 410 flow [2025-01-09 16:24:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:24:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:24:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-01-09 16:24:01,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5253164556962026 [2025-01-09 16:24:01,883 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 146 flow. Second operand 4 states and 166 transitions. [2025-01-09 16:24:01,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 410 flow [2025-01-09 16:24:01,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:24:01,905 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 233 flow [2025-01-09 16:24:01,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-01-09 16:24:01,905 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2025-01-09 16:24:01,906 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 233 flow [2025-01-09 16:24:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:01,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:01,906 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:01,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:24:01,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:24:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash -30585749, now seen corresponding path program 1 times [2025-01-09 16:24:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140319340] [2025-01-09 16:24:01,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:01,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:24:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:24:01,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:24:01,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:01,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140319340] [2025-01-09 16:24:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140319340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:24:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901909134] [2025-01-09 16:24:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:01,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 79 [2025-01-09 16:24:01,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:01,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:01,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 79 [2025-01-09 16:24:01,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:02,176 INFO L124 PetriNetUnfolderBase]: 1988/4139 cut-off events. [2025-01-09 16:24:02,176 INFO L125 PetriNetUnfolderBase]: For 2683/2683 co-relation queries the response was YES. [2025-01-09 16:24:02,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 4139 events. 1988/4139 cut-off events. For 2683/2683 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 30636 event pairs, 261 based on Foata normal form. 3216/7273 useless extension candidates. Maximal degree in co-relation 10448. Up to 2700 conditions per place. [2025-01-09 16:24:02,195 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 32 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2025-01-09 16:24:02,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 349 flow [2025-01-09 16:24:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-01-09 16:24:02,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780590717299579 [2025-01-09 16:24:02,196 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 233 flow. Second operand 3 states and 137 transitions. [2025-01-09 16:24:02,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 349 flow [2025-01-09 16:24:02,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:02,200 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 253 flow [2025-01-09 16:24:02,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-01-09 16:24:02,200 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-01-09 16:24:02,200 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 253 flow [2025-01-09 16:24:02,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:02,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:02,201 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:02,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:24:02,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:24:02,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash 22025758, now seen corresponding path program 1 times [2025-01-09 16:24:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:02,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230390797] [2025-01-09 16:24:02,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:02,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:24:02,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:24:02,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:02,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:02,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:02,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:24:02,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:24:02,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:02,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:02,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:02,222 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:02,222 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-09 16:24:02,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:24:02,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 16:24:02,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-01-09 16:24:02,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-01-09 16:24:02,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-01-09 16:24:02,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:24:02,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:24:02,223 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 16:24:02,223 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:02,223 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 16:24:02,245 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:02,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 97 transitions, 274 flow [2025-01-09 16:24:02,248 INFO L124 PetriNetUnfolderBase]: 7/66 cut-off events. [2025-01-09 16:24:02,248 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:24:02,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 66 events. 7/66 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 88. Up to 6 conditions per place. [2025-01-09 16:24:02,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 97 transitions, 274 flow [2025-01-09 16:24:02,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 52 transitions, 147 flow [2025-01-09 16:24:02,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:02,250 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;@a1d51ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:02,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 16:24:02,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:02,251 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-09 16:24:02,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:02,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:02,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:02,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-09 16:24:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 110104616, now seen corresponding path program 1 times [2025-01-09 16:24:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111410187] [2025-01-09 16:24:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:02,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:24:02,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:24:02,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:02,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:24:02,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111410187] [2025-01-09 16:24:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111410187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:24:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141229885] [2025-01-09 16:24:02,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:02,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:02,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:02,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-01-09 16:24:02,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:02,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:02,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-01-09 16:24:02,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:12,866 INFO L124 PetriNetUnfolderBase]: 178118/228120 cut-off events. [2025-01-09 16:24:12,870 INFO L125 PetriNetUnfolderBase]: For 49465/49465 co-relation queries the response was YES. [2025-01-09 16:24:13,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454639 conditions, 228120 events. 178118/228120 cut-off events. For 49465/49465 co-relation queries the response was YES. Maximal size of possible extension queue 6729. Compared 1409122 event pairs, 48026 based on Foata normal form. 4077/227061 useless extension candidates. Maximal degree in co-relation 454625. Up to 141658 conditions per place. [2025-01-09 16:24:14,395 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 46 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-01-09 16:24:14,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 317 flow [2025-01-09 16:24:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-01-09 16:24:14,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670103092783505 [2025-01-09 16:24:14,397 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-01-09 16:24:14,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 317 flow [2025-01-09 16:24:14,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 292 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-09 16:24:14,414 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 172 flow [2025-01-09 16:24:14,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-01-09 16:24:14,414 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-01-09 16:24:14,414 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 172 flow [2025-01-09 16:24:14,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:14,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:14,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:14,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:24:14,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-09 16:24:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1482366970, now seen corresponding path program 1 times [2025-01-09 16:24:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:14,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573760752] [2025-01-09 16:24:14,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:14,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:24:14,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:24:14,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:14,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:24:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573760752] [2025-01-09 16:24:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573760752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:14,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:24:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817908856] [2025-01-09 16:24:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:14,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:14,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:14,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-01-09 16:24:14,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:14,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:14,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-01-09 16:24:14,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand