./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:39:52,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:39:52,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:39:52,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:39:52,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:39:52,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:39:52,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:39:52,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:39:52,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:39:52,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:39:52,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:39:52,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:39:52,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:39:52,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:39:52,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:39:52,104 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 [2025-03-17 06:39:52,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:39:52,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:39:52,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:39:52,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:39:52,356 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:39:52,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-03-17 06:39:53,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f828082/917edae784a4493db0fd4896c5c0c34d/FLAGc0941e94e [2025-03-17 06:39:53,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:39:53,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-03-17 06:39:53,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f828082/917edae784a4493db0fd4896c5c0c34d/FLAGc0941e94e [2025-03-17 06:39:54,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f828082/917edae784a4493db0fd4896c5c0c34d [2025-03-17 06:39:54,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:39:54,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:39:54,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:39:54,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:39:54,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:39:54,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54, skipping insertion in model container [2025-03-17 06:39:54,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:39:54,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-03-17 06:39:54,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:39:54,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:39:54,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-03-17 06:39:54,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:39:54,200 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:39:54,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54 WrapperNode [2025-03-17 06:39:54,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:39:54,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:39:54,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:39:54,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:39:54,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,225 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 288 [2025-03-17 06:39:54,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:39:54,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:39:54,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:39:54,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:39:54,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,252 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 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 06:39:54,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:39:54,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:39:54,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:39:54,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:39:54,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (1/1) ... [2025-03-17 06:39:54,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:39:54,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:39:54,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:39:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:39:54,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:39:54,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:39:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:39:54,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 06:39:54,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:39:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:39:54,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:39:54,312 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:39:54,398 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:39:54,399 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:39:54,693 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:39:54,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:39:54,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:39:54,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:39:54,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:39:54 BoogieIcfgContainer [2025-03-17 06:39:54,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:39:54,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:39:54,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:39:54,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:39:54,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:39:54" (1/3) ... [2025-03-17 06:39:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c040525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:39:54, skipping insertion in model container [2025-03-17 06:39:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:39:54" (2/3) ... [2025-03-17 06:39:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c040525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:39:54, skipping insertion in model container [2025-03-17 06:39:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:39:54" (3/3) ... [2025-03-17 06:39:54,945 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-03-17 06:39:54,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:39:54,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 46 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-17 06:39:54,957 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:39:55,009 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 06:39:55,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 136 flow [2025-03-17 06:39:55,066 INFO L124 PetriNetUnfolderBase]: 9/50 cut-off events. [2025-03-17 06:39:55,070 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:39:55,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 9/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-17 06:39:55,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 136 flow [2025-03-17 06:39:55,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 49 transitions, 122 flow [2025-03-17 06:39:55,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:39:55,090 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;@52c3f1a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:39:55,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 06:39:55,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:39:55,105 INFO L124 PetriNetUnfolderBase]: 9/48 cut-off events. [2025-03-17 06:39:55,105 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:39:55,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:39:55,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:39:55,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:39:55,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:39:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash -721639232, now seen corresponding path program 1 times [2025-03-17 06:39:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:39:55,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663656549] [2025-03-17 06:39:55,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:39:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:39:55,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:39:55,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:39:55,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:39:55,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:39:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:39:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:39:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663656549] [2025-03-17 06:39:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663656549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:39:55,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:39:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:39:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108762067] [2025-03-17 06:39:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:39:55,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:39:55,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:39:55,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:39:55,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:39:55,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:39:55,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:39:55,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:39:55,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:39:55,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:39:56,874 INFO L124 PetriNetUnfolderBase]: 19909/25913 cut-off events. [2025-03-17 06:39:56,875 INFO L125 PetriNetUnfolderBase]: For 1359/1359 co-relation queries the response was YES. [2025-03-17 06:39:56,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52964 conditions, 25913 events. 19909/25913 cut-off events. For 1359/1359 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 129375 event pairs, 16686 based on Foata normal form. 0/22592 useless extension candidates. Maximal degree in co-relation 49477. Up to 25846 conditions per place. [2025-03-17 06:39:57,021 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 40 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-03-17 06:39:57,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 194 flow [2025-03-17 06:39:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:39:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 06:39:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2025-03-17 06:39:57,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-03-17 06:39:57,030 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 122 flow. Second operand 2 states and 62 transitions. [2025-03-17 06:39:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 194 flow [2025-03-17 06:39:57,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 06:39:57,045 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 98 flow [2025-03-17 06:39:57,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-17 06:39:57,049 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2025-03-17 06:39:57,049 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 98 flow [2025-03-17 06:39:57,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:39:57,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:39:57,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:39:57,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:39:57,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:39:57,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:39:57,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1735707550, now seen corresponding path program 1 times [2025-03-17 06:39:57,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:39:57,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798654113] [2025-03-17 06:39:57,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:39:57,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:39:57,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 06:39:57,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 06:39:57,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:39:57,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:39:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:39:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:39:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798654113] [2025-03-17 06:39:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798654113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:39:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:39:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:39:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015624363] [2025-03-17 06:39:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:39:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:39:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:39:57,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:39:57,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:39:57,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:39:57,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:39:57,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:39:57,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:39:57,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:39:59,015 INFO L124 PetriNetUnfolderBase]: 31442/40864 cut-off events. [2025-03-17 06:39:59,016 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-03-17 06:39:59,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82326 conditions, 40864 events. 31442/40864 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 221379 event pairs, 9215 based on Foata normal form. 1/35416 useless extension candidates. Maximal degree in co-relation 82323. Up to 28277 conditions per place. [2025-03-17 06:39:59,168 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 69 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2025-03-17 06:39:59,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 325 flow [2025-03-17 06:39:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:39:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:39:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-17 06:39:59,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-03-17 06:39:59,171 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 98 flow. Second operand 3 states and 103 transitions. [2025-03-17 06:39:59,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 325 flow [2025-03-17 06:39:59,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:39:59,176 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 131 flow [2025-03-17 06:39:59,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-03-17 06:39:59,177 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2025-03-17 06:39:59,177 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 131 flow [2025-03-17 06:39:59,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:39:59,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:39:59,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:39:59,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:39:59,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:39:59,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:39:59,178 INFO L85 PathProgramCache]: Analyzing trace with hash -443219883, now seen corresponding path program 1 times [2025-03-17 06:39:59,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:39:59,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864338086] [2025-03-17 06:39:59,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:39:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:39:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:39:59,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:39:59,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:39:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:39:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:39:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:39:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864338086] [2025-03-17 06:39:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864338086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:39:59,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:39:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:39:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307536399] [2025-03-17 06:39:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:39:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:39:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:39:59,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:39:59,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:39:59,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:39:59,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:39:59,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:39:59,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:39:59,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:02,088 INFO L124 PetriNetUnfolderBase]: 47144/62026 cut-off events. [2025-03-17 06:40:02,089 INFO L125 PetriNetUnfolderBase]: For 4577/4577 co-relation queries the response was YES. [2025-03-17 06:40:02,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134504 conditions, 62026 events. 47144/62026 cut-off events. For 4577/4577 co-relation queries the response was YES. Maximal size of possible extension queue 2225. Compared 356388 event pairs, 39870 based on Foata normal form. 2027/55113 useless extension candidates. Maximal degree in co-relation 134499. Up to 40409 conditions per place. [2025-03-17 06:40:02,278 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 2 changer transitions 35/85 dead transitions. [2025-03-17 06:40:02,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 384 flow [2025-03-17 06:40:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:40:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:40:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-03-17 06:40:02,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-03-17 06:40:02,280 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 131 flow. Second operand 4 states and 113 transitions. [2025-03-17 06:40:02,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 384 flow [2025-03-17 06:40:02,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:02,286 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 144 flow [2025-03-17 06:40:02,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-17 06:40:02,287 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-03-17 06:40:02,287 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 144 flow [2025-03-17 06:40:02,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:02,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:02,287 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:02,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:40:02,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -619579639, now seen corresponding path program 1 times [2025-03-17 06:40:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:02,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638237535] [2025-03-17 06:40:02,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:02,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:40:02,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:40:02,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:02,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638237535] [2025-03-17 06:40:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638237535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096306715] [2025-03-17 06:40:02,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:02,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:02,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:02,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:40:02,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:40:02,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:40:02,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:40:02,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:02,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:02,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:40:02,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:02,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096306715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:40:02,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:40:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 06:40:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407915449] [2025-03-17 06:40:02,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:40:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:40:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:02,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:40:02,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:40:02,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:40:02,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 144 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:02,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:02,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:40:02,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:05,509 INFO L124 PetriNetUnfolderBase]: 47144/62029 cut-off events. [2025-03-17 06:40:05,509 INFO L125 PetriNetUnfolderBase]: For 9176/9176 co-relation queries the response was YES. [2025-03-17 06:40:05,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134400 conditions, 62029 events. 47144/62029 cut-off events. For 9176/9176 co-relation queries the response was YES. Maximal size of possible extension queue 2225. Compared 356309 event pairs, 39870 based on Foata normal form. 2026/55115 useless extension candidates. Maximal degree in co-relation 134393. Up to 40408 conditions per place. [2025-03-17 06:40:05,762 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 75 selfloop transitions, 5 changer transitions 2/87 dead transitions. [2025-03-17 06:40:05,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 408 flow [2025-03-17 06:40:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-03-17 06:40:05,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-03-17 06:40:05,766 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 144 flow. Second operand 6 states and 132 transitions. [2025-03-17 06:40:05,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 408 flow [2025-03-17 06:40:05,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 400 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:05,775 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 179 flow [2025-03-17 06:40:05,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-17 06:40:05,775 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-03-17 06:40:05,775 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 179 flow [2025-03-17 06:40:05,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:05,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:05,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:05,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:40:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:05,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 258168905, now seen corresponding path program 1 times [2025-03-17 06:40:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876241935] [2025-03-17 06:40:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:05,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:40:06,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:40:06,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:06,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876241935] [2025-03-17 06:40:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876241935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745601807] [2025-03-17 06:40:06,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:06,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:40:06,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:40:06,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:40:06,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:40:06,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:06,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:06,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:40:06,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:06,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:06,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745601807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:40:06,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:40:06,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 06:40:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918014421] [2025-03-17 06:40:06,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:40:06,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:40:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:06,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:40:06,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:40:06,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:40:06,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 179 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:06,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:06,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:40:06,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:08,587 INFO L124 PetriNetUnfolderBase]: 35526/46746 cut-off events. [2025-03-17 06:40:08,587 INFO L125 PetriNetUnfolderBase]: For 11625/11625 co-relation queries the response was YES. [2025-03-17 06:40:08,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104803 conditions, 46746 events. 35526/46746 cut-off events. For 11625/11625 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 257484 event pairs, 29704 based on Foata normal form. 611/40743 useless extension candidates. Maximal degree in co-relation 104794. Up to 40408 conditions per place. [2025-03-17 06:40:08,754 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 42 selfloop transitions, 4 changer transitions 29/80 dead transitions. [2025-03-17 06:40:08,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 387 flow [2025-03-17 06:40:08,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-17 06:40:08,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39197530864197533 [2025-03-17 06:40:08,756 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 179 flow. Second operand 6 states and 127 transitions. [2025-03-17 06:40:08,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 387 flow [2025-03-17 06:40:08,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 372 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-17 06:40:08,763 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 162 flow [2025-03-17 06:40:08,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-03-17 06:40:08,764 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-03-17 06:40:08,764 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 162 flow [2025-03-17 06:40:08,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:08,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:08,764 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:08,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:40:08,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:08,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:08,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1481446823, now seen corresponding path program 2 times [2025-03-17 06:40:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474641906] [2025-03-17 06:40:08,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:40:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:08,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 06:40:08,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 38 statements. [2025-03-17 06:40:08,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:40:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:40:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474641906] [2025-03-17 06:40:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474641906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:40:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277352320] [2025-03-17 06:40:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:09,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:40:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:09,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:40:09,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:40:09,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:40:09,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:09,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:09,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:40:09,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:13,249 INFO L124 PetriNetUnfolderBase]: 70326/91170 cut-off events. [2025-03-17 06:40:13,249 INFO L125 PetriNetUnfolderBase]: For 15314/15314 co-relation queries the response was YES. [2025-03-17 06:40:13,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207346 conditions, 91170 events. 70326/91170 cut-off events. For 15314/15314 co-relation queries the response was YES. Maximal size of possible extension queue 3001. Compared 530743 event pairs, 19930 based on Foata normal form. 1/79433 useless extension candidates. Maximal degree in co-relation 207336. Up to 31389 conditions per place. [2025-03-17 06:40:13,737 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 112 selfloop transitions, 8 changer transitions 1/126 dead transitions. [2025-03-17 06:40:13,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 126 transitions, 620 flow [2025-03-17 06:40:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:40:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:40:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-03-17 06:40:13,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 06:40:13,738 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 162 flow. Second operand 4 states and 144 transitions. [2025-03-17 06:40:13,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 126 transitions, 620 flow [2025-03-17 06:40:13,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 608 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 06:40:13,745 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 226 flow [2025-03-17 06:40:13,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-03-17 06:40:13,746 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-03-17 06:40:13,746 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 226 flow [2025-03-17 06:40:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:13,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:13,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:13,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:40:13,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1599814463, now seen corresponding path program 2 times [2025-03-17 06:40:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896843683] [2025-03-17 06:40:13,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:40:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:13,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 06:40:13,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 38 statements. [2025-03-17 06:40:13,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:40:13,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:40:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896843683] [2025-03-17 06:40:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896843683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:40:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399013087] [2025-03-17 06:40:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:40:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:13,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:40:13,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:40:13,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:40:13,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:13,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:13,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:40:13,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:18,742 INFO L124 PetriNetUnfolderBase]: 80077/103809 cut-off events. [2025-03-17 06:40:18,743 INFO L125 PetriNetUnfolderBase]: For 52131/52131 co-relation queries the response was YES. [2025-03-17 06:40:18,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255353 conditions, 103809 events. 80077/103809 cut-off events. For 52131/52131 co-relation queries the response was YES. Maximal size of possible extension queue 3427. Compared 605165 event pairs, 14966 based on Foata normal form. 1/90139 useless extension candidates. Maximal degree in co-relation 255342. Up to 82350 conditions per place. [2025-03-17 06:40:19,237 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 100 selfloop transitions, 9 changer transitions 6/120 dead transitions. [2025-03-17 06:40:19,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 120 transitions, 640 flow [2025-03-17 06:40:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:40:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:40:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-03-17 06:40:19,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2025-03-17 06:40:19,239 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 226 flow. Second operand 4 states and 137 transitions. [2025-03-17 06:40:19,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 120 transitions, 640 flow [2025-03-17 06:40:20,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 604 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:20,244 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 279 flow [2025-03-17 06:40:20,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2025-03-17 06:40:20,245 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-17 06:40:20,245 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 279 flow [2025-03-17 06:40:20,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:20,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:20,245 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:20,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:40:20,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:20,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 225849618, now seen corresponding path program 1 times [2025-03-17 06:40:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935164183] [2025-03-17 06:40:20,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:20,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 06:40:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:40:20,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:20,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935164183] [2025-03-17 06:40:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935164183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074949504] [2025-03-17 06:40:21,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:21,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:40:21,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:40:21,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 06:40:21,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 06:40:21,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:21,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:21,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 06:40:21,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:21,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:40:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-03-17 06:40:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:21,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:40:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074949504] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:40:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 23 [2025-03-17 06:40:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454774032] [2025-03-17 06:40:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:40:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:40:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:40:21,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-17 06:40:21,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:21,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:21,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-17 06:40:21,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand