./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/40_barrier_vf.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/40_barrier_vf.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 e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:24:27,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:24:28,031 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:24:28,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:24:28,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:24:28,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:24:28,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:24:28,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:24:28,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:24:28,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:24:28,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:24:28,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:24:28,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:24:28,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:24:28,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:24:28,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:24:28,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:24:28,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:24:28,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:24:28,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:24:28,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:24:28,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:24:28,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:24:28,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:24:28,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:24:28,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:24:28,065 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 -> e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 [2025-01-09 16:24:28,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:24:28,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:24:28,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:24:28,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:24:28,271 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:24:28,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-01-09 16:24:29,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a53ce3d4/c5c42482b3244f9e8fe14950c0f7ead7/FLAG4fb2f19f4 [2025-01-09 16:24:29,777 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:24:29,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-01-09 16:24:29,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a53ce3d4/c5c42482b3244f9e8fe14950c0f7ead7/FLAG4fb2f19f4 [2025-01-09 16:24:29,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a53ce3d4/c5c42482b3244f9e8fe14950c0f7ead7 [2025-01-09 16:24:29,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:24:29,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:24:29,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:24:29,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:24:29,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:24:29,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29, skipping insertion in model container [2025-01-09 16:24:29,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:24:30,046 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/40_barrier_vf.i[30834,30847] [2025-01-09 16:24:30,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:24:30,068 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:24:30,102 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/40_barrier_vf.i[30834,30847] [2025-01-09 16:24:30,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:24:30,126 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:24:30,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30 WrapperNode [2025-01-09 16:24:30,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:24:30,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:24:30,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:24:30,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:24:30,132 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:24:30" (1/1) ... [2025-01-09 16:24:30,143 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:24:30" (1/1) ... [2025-01-09 16:24:30,154 INFO L138 Inliner]: procedures = 164, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 166 [2025-01-09 16:24:30,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:24:30,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:24:30,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:24:30,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:24:30,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,169 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:24:30,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:24:30,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:24:30,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:24:30,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:24:30,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 16:24:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:24:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:24:30,216 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:24:30,223 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:24:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:24:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:24:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:24:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:24:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:24:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:24:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:24:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:24:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:24:30,238 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:24:30,349 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:24:30,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:24:30,514 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:24:30,514 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:24:31,137 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:24:31,137 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 16:24:31,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:31 BoogieIcfgContainer [2025-01-09 16:24:31,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:24:31,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:24:31,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:24:31,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:24:31,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:24:29" (1/3) ... [2025-01-09 16:24:31,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:31, skipping insertion in model container [2025-01-09 16:24:31,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (2/3) ... [2025-01-09 16:24:31,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:31, skipping insertion in model container [2025-01-09 16:24:31,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:31" (3/3) ... [2025-01-09 16:24:31,145 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-01-09 16:24:31,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:24:31,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:24:31,155 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:24:31,180 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:31,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 42 flow [2025-01-09 16:24:31,215 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-01-09 16:24:31,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:31,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-01-09 16:24:31,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 19 transitions, 42 flow [2025-01-09 16:24:31,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 19 transitions, 42 flow [2025-01-09 16:24:31,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:31,229 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;@6c88f772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:31,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:24:31,237 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:31,237 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-09 16:24:31,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:31,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:31,238 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:24:31,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:24:31,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:31,243 INFO L85 PathProgramCache]: Analyzing trace with hash -990904300, now seen corresponding path program 1 times [2025-01-09 16:24:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:31,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-01-09 16:24:31,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:24:31,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:24:31,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:31,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:31,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:24:31,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:24:31,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:31,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:31,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:31,614 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:24:31,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:24:31,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:24:31,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:24:31,616 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:24:31,620 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:31,620 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:24:31,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:31,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 76 flow [2025-01-09 16:24:31,668 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-09 16:24:31,669 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:24:31,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-01-09 16:24:31,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 76 flow [2025-01-09 16:24:31,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 76 flow [2025-01-09 16:24:31,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:31,671 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;@6c88f772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:31,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:24:31,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:31,682 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-01-09 16:24:31,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:24:31,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:31,683 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:24:31,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:24:31,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash 294490384, now seen corresponding path program 1 times [2025-01-09 16:24:31,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:31,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888075454] [2025-01-09 16:24:31,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:31,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:24:31,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:24:31,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:31,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:31,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:24:31,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:24:31,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:31,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:31,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:31,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:24:31,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:24:31,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:24:31,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:24:31,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:24:31,922 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:24:31,922 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:31,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:24:31,947 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 112 flow [2025-01-09 16:24:31,970 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2025-01-09 16:24:31,971 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:24:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2025-01-09 16:24:31,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 112 flow [2025-01-09 16:24:31,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 47 transitions, 112 flow [2025-01-09 16:24:31,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:31,976 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;@6c88f772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:31,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:24:31,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:31,989 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-01-09 16:24:31,989 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:24:31,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:31,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:31,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:24:31,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1366588211, now seen corresponding path program 1 times [2025-01-09 16:24:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859429444] [2025-01-09 16:24:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:32,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:24:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:24:32,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:32,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:32,311 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:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859429444] [2025-01-09 16:24:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859429444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:32,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:24:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487168638] [2025-01-09 16:24:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:32,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:32,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:32,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:32,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-01-09 16:24:32,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:32,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:32,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-01-09 16:24:32,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:33,288 INFO L124 PetriNetUnfolderBase]: 9491/15282 cut-off events. [2025-01-09 16:24:33,288 INFO L125 PetriNetUnfolderBase]: For 541/541 co-relation queries the response was YES. [2025-01-09 16:24:33,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28183 conditions, 15282 events. 9491/15282 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 110782 event pairs, 2648 based on Foata normal form. 2298/16657 useless extension candidates. Maximal degree in co-relation 16555. Up to 5293 conditions per place. [2025-01-09 16:24:33,353 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 69 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2025-01-09 16:24:33,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 92 transitions, 379 flow [2025-01-09 16:24:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:24:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:24:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-01-09 16:24:33,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7925531914893617 [2025-01-09 16:24:33,367 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 112 flow. Second operand 4 states and 149 transitions. [2025-01-09 16:24:33,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 92 transitions, 379 flow [2025-01-09 16:24:33,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 373 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:33,372 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 140 flow [2025-01-09 16:24:33,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2025-01-09 16:24:33,375 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-01-09 16:24:33,375 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 140 flow [2025-01-09 16:24:33,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:33,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:33,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:33,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:24:33,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:24:33,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 584453812, now seen corresponding path program 1 times [2025-01-09 16:24:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-01-09 16:24:33,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:33,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:24:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:24:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:33,533 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:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-01-09 16:24:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865810003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:24:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-01-09 16:24:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:33,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:33,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:33,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:24:33,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:33,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:33,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:24:33,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:34,151 INFO L124 PetriNetUnfolderBase]: 6742/10548 cut-off events. [2025-01-09 16:24:34,152 INFO L125 PetriNetUnfolderBase]: For 652/652 co-relation queries the response was YES. [2025-01-09 16:24:34,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20679 conditions, 10548 events. 6742/10548 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 68442 event pairs, 2218 based on Foata normal form. 474/10974 useless extension candidates. Maximal degree in co-relation 17549. Up to 6994 conditions per place. [2025-01-09 16:24:34,200 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 53 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-01-09 16:24:34,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 301 flow [2025-01-09 16:24:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-09 16:24:34,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-01-09 16:24:34,201 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 140 flow. Second operand 3 states and 84 transitions. [2025-01-09 16:24:34,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 301 flow [2025-01-09 16:24:34,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:34,204 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 158 flow [2025-01-09 16:24:34,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-01-09 16:24:34,204 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-01-09 16:24:34,204 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 158 flow [2025-01-09 16:24:34,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:34,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:34,205 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:24:34,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:24:34,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:24:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1377850061, now seen corresponding path program 1 times [2025-01-09 16:24:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:34,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855973633] [2025-01-09 16:24:34,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:34,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:34,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:24:34,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:24:34,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:34,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:34,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:34,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:24:34,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:24:34,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:34,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:34,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:34,334 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:34,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:24:34,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:24:34,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:24:34,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:24:34,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:24:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:24:34,334 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:24:34,335 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:34,335 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:24:34,361 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:34,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 150 flow [2025-01-09 16:24:34,375 INFO L124 PetriNetUnfolderBase]: 8/72 cut-off events. [2025-01-09 16:24:34,376 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:24:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 8/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 183 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2025-01-09 16:24:34,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 61 transitions, 150 flow [2025-01-09 16:24:34,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 61 transitions, 150 flow [2025-01-09 16:24:34,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:34,380 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;@6c88f772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:34,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:24:34,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:34,387 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-01-09 16:24:34,387 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:24:34,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:34,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:34,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 209334637, now seen corresponding path program 1 times [2025-01-09 16:24:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132030264] [2025-01-09 16:24:34,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:34,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:24:34,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:24:34,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:34,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:34,585 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:34,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:34,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132030264] [2025-01-09 16:24:34,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132030264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:34,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:34,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:24:34,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025589997] [2025-01-09 16:24:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:34,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:34,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:34,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:34,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:34,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-01-09 16:24:34,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:34,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:34,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-01-09 16:24:34,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:43,723 INFO L124 PetriNetUnfolderBase]: 148268/213604 cut-off events. [2025-01-09 16:24:43,723 INFO L125 PetriNetUnfolderBase]: For 11258/11258 co-relation queries the response was YES. [2025-01-09 16:24:44,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400726 conditions, 213604 events. 148268/213604 cut-off events. For 11258/11258 co-relation queries the response was YES. Maximal size of possible extension queue 9774. Compared 1767231 event pairs, 41632 based on Foata normal form. 33717/235656 useless extension candidates. Maximal degree in co-relation 132930. Up to 73569 conditions per place. [2025-01-09 16:24:45,233 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 91 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2025-01-09 16:24:45,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 515 flow [2025-01-09 16:24:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:24:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:24:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-01-09 16:24:45,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7991803278688525 [2025-01-09 16:24:45,235 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 150 flow. Second operand 4 states and 195 transitions. [2025-01-09 16:24:45,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 515 flow [2025-01-09 16:24:45,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 121 transitions, 497 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:45,243 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 184 flow [2025-01-09 16:24:45,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-01-09 16:24:45,243 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2025-01-09 16:24:45,244 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 184 flow [2025-01-09 16:24:45,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:45,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:45,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:45,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:24:45,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:45,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2101545378, now seen corresponding path program 1 times [2025-01-09 16:24:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665776012] [2025-01-09 16:24:45,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:45,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:24:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:24:45,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:45,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:45,387 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:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665776012] [2025-01-09 16:24:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665776012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:45,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:24:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312306588] [2025-01-09 16:24:45,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:45,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:45,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:45,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:45,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2025-01-09 16:24:45,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:45,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:45,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2025-01-09 16:24:45,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:52,940 INFO L124 PetriNetUnfolderBase]: 124939/175614 cut-off events. [2025-01-09 16:24:52,941 INFO L125 PetriNetUnfolderBase]: For 11906/11906 co-relation queries the response was YES. [2025-01-09 16:24:53,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348301 conditions, 175614 events. 124939/175614 cut-off events. For 11906/11906 co-relation queries the response was YES. Maximal size of possible extension queue 6970. Compared 1338166 event pairs, 36811 based on Foata normal form. 4062/178368 useless extension candidates. Maximal degree in co-relation 296379. Up to 140026 conditions per place. [2025-01-09 16:24:54,072 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 78 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-01-09 16:24:54,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 448 flow [2025-01-09 16:24:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-09 16:24:54,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2025-01-09 16:24:54,073 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 184 flow. Second operand 3 states and 114 transitions. [2025-01-09 16:24:54,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 448 flow [2025-01-09 16:24:54,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:54,078 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 231 flow [2025-01-09 16:24:54,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2025-01-09 16:24:54,079 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-01-09 16:24:54,079 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 231 flow [2025-01-09 16:24:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:54,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:54,079 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:54,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:24:54,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -978526955, now seen corresponding path program 1 times [2025-01-09 16:24:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77589026] [2025-01-09 16:24:54,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:24:54,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:24:54,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:54,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:54,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:54,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:24:54,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:24:54,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:54,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:54,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:54,229 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:54,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:24:54,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:24:54,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-01-09 16:24:54,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:24:54,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:24:54,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:24:54,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:24:54,231 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:24:54,232 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:54,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 16:24:54,266 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:54,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 190 flow [2025-01-09 16:24:54,277 INFO L124 PetriNetUnfolderBase]: 10/89 cut-off events. [2025-01-09 16:24:54,278 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:24:54,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 10/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 234 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2025-01-09 16:24:54,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 190 flow [2025-01-09 16:24:54,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 190 flow [2025-01-09 16:24:54,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:54,280 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;@6c88f772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:54,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:24:54,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:54,287 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-01-09 16:24:54,287 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:24:54,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:54,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:54,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:24:54,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash 8906867, now seen corresponding path program 1 times [2025-01-09 16:24:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375299508] [2025-01-09 16:24:54,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:54,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:24:54,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:24:54,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:54,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:54,468 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:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375299508] [2025-01-09 16:24:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375299508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:24:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496733580] [2025-01-09 16:24:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:54,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:54,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:54,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-01-09 16:24:54,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:54,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:54,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-01-09 16:24:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand