./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/popl20-simple-queue.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 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:27:24,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:27:24,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:27:24,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:27:24,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:27:25,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:27:25,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:27:25,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:27:25,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:27:25,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:27:25,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:27:25,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:27:25,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:27:25,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:27:25,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:27:25,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:27:25,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:27:25,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:27:25,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:25,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:27:25,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:27:25,019 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 -> 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 [2025-03-04 02:27:25,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:27:25,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:27:25,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:27:25,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:27:25,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:27:25,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-03-04 02:27:26,378 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cc355ab/75214b52040a47efab80d7e67e51594c/FLAG93f6d0ea1 [2025-03-04 02:27:26,598 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:27:26,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-03-04 02:27:26,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cc355ab/75214b52040a47efab80d7e67e51594c/FLAG93f6d0ea1 [2025-03-04 02:27:26,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cc355ab/75214b52040a47efab80d7e67e51594c [2025-03-04 02:27:26,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:27:26,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:27:26,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:26,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:27:26,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:27:26,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:26" (1/1) ... [2025-03-04 02:27:26,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5990ce9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:26, skipping insertion in model container [2025-03-04 02:27:26,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:26" (1/1) ... [2025-03-04 02:27:26,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:27:27,082 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/popl20-simple-queue.wvr.c[2464,2477] [2025-03-04 02:27:27,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:27,098 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:27:27,109 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/popl20-simple-queue.wvr.c[2464,2477] [2025-03-04 02:27:27,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:27,123 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:27:27,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27 WrapperNode [2025-03-04 02:27:27,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:27,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:27,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:27:27,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:27:27,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,152 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 120 [2025-03-04 02:27:27,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:27,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:27:27,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:27:27,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:27:27,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,177 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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-04 02:27:27,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:27:27,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:27:27,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:27:27,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:27:27,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (1/1) ... [2025-03-04 02:27:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:27,217 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-04 02:27:27,219 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-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:27:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:27:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:27:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:27:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:27:27,235 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:27:27,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:27:27,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:27:27,513 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:27:27,513 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:27:27,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:27:27,655 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:27:27,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:27 BoogieIcfgContainer [2025-03-04 02:27:27,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:27:27,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:27:27,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:27:27,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:27:27,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:27:26" (1/3) ... [2025-03-04 02:27:27,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7809f9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:27, skipping insertion in model container [2025-03-04 02:27:27,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:27" (2/3) ... [2025-03-04 02:27:27,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7809f9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:27, skipping insertion in model container [2025-03-04 02:27:27,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:27" (3/3) ... [2025-03-04 02:27:27,664 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-03-04 02:27:27,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:27:27,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:27:27,675 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:27:27,714 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:27:27,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-03-04 02:27:27,763 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-04 02:27:27,765 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:27:27,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 5/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-04 02:27:27,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-03-04 02:27:27,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 62 flow [2025-03-04 02:27:27,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:27:27,784 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;@514b338a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:27:27,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:27:27,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:27:27,790 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-03-04 02:27:27,790 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:27:27,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:27,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:27,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1076186452, now seen corresponding path program 1 times [2025-03-04 02:27:27,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497566293] [2025-03-04 02:27:27,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:27,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:27:27,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:27:27,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:27,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:27,939 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-04 02:27:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497566293] [2025-03-04 02:27:27,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497566293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:27,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:27,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152692657] [2025-03-04 02:27:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:27,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:27:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:27,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:27:27,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:27:27,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:27,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-04 02:27:27,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:27,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:27,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,067 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2025-03-04 02:27:28,067 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:27:28,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 217 events. 122/217 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 714 event pairs, 94 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 405. Up to 214 conditions per place. [2025-03-04 02:27:28,073 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-03-04 02:27:28,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 98 flow [2025-03-04 02:27:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:27:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:27:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-03-04 02:27:28,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 02:27:28,083 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 2 states and 32 transitions. [2025-03-04 02:27:28,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 98 flow [2025-03-04 02:27:28,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:27:28,087 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2025-03-04 02:27:28,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-03-04 02:27:28,090 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-03-04 02:27:28,091 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2025-03-04 02:27:28,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-04 02:27:28,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:28,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:27:28,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:28,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash -108195879, now seen corresponding path program 1 times [2025-03-04 02:27:28,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656491652] [2025-03-04 02:27:28,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:27:28,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:27:28,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:28,188 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-04 02:27:28,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656491652] [2025-03-04 02:27:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656491652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035469734] [2025-03-04 02:27:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:27:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:27:28,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:27:28,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:28,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 02:27:28,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:28,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,270 INFO L124 PetriNetUnfolderBase]: 203/353 cut-off events. [2025-03-04 02:27:28,270 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 02:27:28,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 353 events. 203/353 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1257 event pairs, 82 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 709. Up to 176 conditions per place. [2025-03-04 02:27:28,274 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 28 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-03-04 02:27:28,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 144 flow [2025-03-04 02:27:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:27:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:27:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-04 02:27:28,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:27:28,276 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 49 transitions. [2025-03-04 02:27:28,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 144 flow [2025-03-04 02:27:28,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:28,277 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2025-03-04 02:27:28,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-03-04 02:27:28,278 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-04 02:27:28,278 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2025-03-04 02:27:28,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 02:27:28,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,279 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] [2025-03-04 02:27:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:27:28,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:28,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1313110838, now seen corresponding path program 1 times [2025-03-04 02:27:28,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414218375] [2025-03-04 02:27:28,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:27:28,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:28,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:28,391 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-04 02:27:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414218375] [2025-03-04 02:27:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414218375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784398342] [2025-03-04 02:27:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:27:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:27:28,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:27:28,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:28,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 02:27:28,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:28,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,477 INFO L124 PetriNetUnfolderBase]: 251/446 cut-off events. [2025-03-04 02:27:28,478 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 02:27:28,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 446 events. 251/446 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1678 event pairs, 113 based on Foata normal form. 11/385 useless extension candidates. Maximal degree in co-relation 934. Up to 306 conditions per place. [2025-03-04 02:27:28,479 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2025-03-04 02:27:28,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 163 flow [2025-03-04 02:27:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:27:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:27:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-04 02:27:28,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 02:27:28,481 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-03-04 02:27:28,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 163 flow [2025-03-04 02:27:28,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:28,482 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2025-03-04 02:27:28,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-03-04 02:27:28,483 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2025-03-04 02:27:28,483 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2025-03-04 02:27:28,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 02:27:28,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,483 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] [2025-03-04 02:27:28,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:27:28,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:28,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 845850198, now seen corresponding path program 1 times [2025-03-04 02:27:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129493470] [2025-03-04 02:27:28,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:27:28,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:27:28,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:28,655 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-04 02:27:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129493470] [2025-03-04 02:27:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129493470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:28,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336191909] [2025-03-04 02:27:28,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:28,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:28,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:28,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:28,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-04 02:27:28,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:28,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,747 INFO L124 PetriNetUnfolderBase]: 319/585 cut-off events. [2025-03-04 02:27:28,748 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 02:27:28,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 585 events. 319/585 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2456 event pairs, 285 based on Foata normal form. 12/501 useless extension candidates. Maximal degree in co-relation 1262. Up to 443 conditions per place. [2025-03-04 02:27:28,750 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 21 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2025-03-04 02:27:28,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 184 flow [2025-03-04 02:27:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-04 02:27:28,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-03-04 02:27:28,751 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 4 states and 57 transitions. [2025-03-04 02:27:28,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 184 flow [2025-03-04 02:27:28,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:28,752 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 84 flow [2025-03-04 02:27:28,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-03-04 02:27:28,753 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-03-04 02:27:28,753 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2025-03-04 02:27:28,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-04 02:27:28,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,753 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] [2025-03-04 02:27:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:27:28,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -77824490, now seen corresponding path program 1 times [2025-03-04 02:27:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943331390] [2025-03-04 02:27:28,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:27:28,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:27:28,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:29,134 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-04 02:27:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943331390] [2025-03-04 02:27:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943331390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208991514] [2025-03-04 02:27:29,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:29,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:29,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:29,137 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-04 02:27:29,139 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-04 02:27:29,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:27:29,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:27:29,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:29,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:29,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:27:29,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:29,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 02:27:29,432 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-04 02:27:29,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:29,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-03-04 02:27:29,806 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:27:29,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 37 [2025-03-04 02:27:29,854 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-04 02:27:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208991514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:29,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:29,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 02:27:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978460853] [2025-03-04 02:27:29,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:29,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:27:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:29,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:27:29,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:27:29,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:29,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 15 states have internal predecessors, (131), 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-04 02:27:29,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:29,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:29,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:30,508 INFO L124 PetriNetUnfolderBase]: 1151/2030 cut-off events. [2025-03-04 02:27:30,509 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-03-04 02:27:30,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4453 conditions, 2030 events. 1151/2030 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10458 event pairs, 423 based on Foata normal form. 5/1719 useless extension candidates. Maximal degree in co-relation 4445. Up to 452 conditions per place. [2025-03-04 02:27:30,517 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 109 selfloop transitions, 21 changer transitions 30/163 dead transitions. [2025-03-04 02:27:30,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 163 transitions, 764 flow [2025-03-04 02:27:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:27:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:27:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2025-03-04 02:27:30,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-04 02:27:30,519 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 14 states and 231 transitions. [2025-03-04 02:27:30,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 163 transitions, 764 flow [2025-03-04 02:27:30,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 163 transitions, 752 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:27:30,522 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 258 flow [2025-03-04 02:27:30,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=258, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-04 02:27:30,523 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2025-03-04 02:27:30,523 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 258 flow [2025-03-04 02:27:30,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 15 states have internal predecessors, (131), 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-04 02:27:30,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:30,524 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:30,530 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-04 02:27:30,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:30,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:30,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash -568733586, now seen corresponding path program 2 times [2025-03-04 02:27:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:30,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333085332] [2025-03-04 02:27:30,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:30,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:27:30,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 02:27:30,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:27:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:27:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333085332] [2025-03-04 02:27:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333085332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:27:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002180426] [2025-03-04 02:27:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:30,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:30,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:27:30,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:30,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-04 02:27:30,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:30,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:30,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:31,029 INFO L124 PetriNetUnfolderBase]: 1311/2302 cut-off events. [2025-03-04 02:27:31,030 INFO L125 PetriNetUnfolderBase]: For 1626/1626 co-relation queries the response was YES. [2025-03-04 02:27:31,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5651 conditions, 2302 events. 1311/2302 cut-off events. For 1626/1626 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12133 event pairs, 360 based on Foata normal form. 1/1937 useless extension candidates. Maximal degree in co-relation 5636. Up to 727 conditions per place. [2025-03-04 02:27:31,039 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 57 selfloop transitions, 12 changer transitions 12/84 dead transitions. [2025-03-04 02:27:31,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 530 flow [2025-03-04 02:27:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:27:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:27:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-04 02:27:31,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-03-04 02:27:31,041 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 258 flow. Second operand 5 states and 86 transitions. [2025-03-04 02:27:31,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 530 flow [2025-03-04 02:27:31,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 508 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:31,049 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 286 flow [2025-03-04 02:27:31,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-03-04 02:27:31,051 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2025-03-04 02:27:31,051 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 286 flow [2025-03-04 02:27:31,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-04 02:27:31,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:31,052 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:31,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:27:31,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash 550802081, now seen corresponding path program 3 times [2025-03-04 02:27:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695661852] [2025-03-04 02:27:31,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:31,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:27:31,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:27:31,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:27:31,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695661852] [2025-03-04 02:27:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695661852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121929184] [2025-03-04 02:27:31,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:31,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:31,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:31,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:31,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:31,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-04 02:27:31,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:31,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:31,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:31,358 INFO L124 PetriNetUnfolderBase]: 2326/4079 cut-off events. [2025-03-04 02:27:31,358 INFO L125 PetriNetUnfolderBase]: For 4175/4175 co-relation queries the response was YES. [2025-03-04 02:27:31,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10277 conditions, 4079 events. 2326/4079 cut-off events. For 4175/4175 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 23817 event pairs, 936 based on Foata normal form. 55/3489 useless extension candidates. Maximal degree in co-relation 10260. Up to 1781 conditions per place. [2025-03-04 02:27:31,376 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 67 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2025-03-04 02:27:31,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 650 flow [2025-03-04 02:27:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-04 02:27:31,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 02:27:31,377 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 286 flow. Second operand 4 states and 72 transitions. [2025-03-04 02:27:31,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 650 flow [2025-03-04 02:27:31,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 612 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 02:27:31,387 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 452 flow [2025-03-04 02:27:31,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=452, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2025-03-04 02:27:31,389 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2025-03-04 02:27:31,390 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 452 flow [2025-03-04 02:27:31,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-04 02:27:31,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:31,390 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:31,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:27:31,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:31,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1547882427, now seen corresponding path program 4 times [2025-03-04 02:27:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775167450] [2025-03-04 02:27:31,391 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:31,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:27:31,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:27:31,422 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:31,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775167450] [2025-03-04 02:27:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775167450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655028591] [2025-03-04 02:27:31,580 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:31,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:31,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:31,582 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-04 02:27:31,584 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-04 02:27:31,624 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:27:31,642 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:27:31,642 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:31,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:27:31,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:31,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 02:27:31,848 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:27:31,848 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 23 treesize of output 10 [2025-03-04 02:27:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:31,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:32,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-03-04 02:27:32,189 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 02:27:32,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 43 [2025-03-04 02:27:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655028591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:32,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:32,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2025-03-04 02:27:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284562320] [2025-03-04 02:27:32,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:32,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:27:32,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:32,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:27:32,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:27:32,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:32,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 452 flow. Second operand has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 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-04 02:27:32,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:32,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:33,444 INFO L124 PetriNetUnfolderBase]: 3882/6831 cut-off events. [2025-03-04 02:27:33,445 INFO L125 PetriNetUnfolderBase]: For 11394/11394 co-relation queries the response was YES. [2025-03-04 02:27:33,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17965 conditions, 6831 events. 3882/6831 cut-off events. For 11394/11394 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 43309 event pairs, 599 based on Foata normal form. 132/5881 useless extension candidates. Maximal degree in co-relation 17947. Up to 1250 conditions per place. [2025-03-04 02:27:33,469 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 129 selfloop transitions, 37 changer transitions 96/265 dead transitions. [2025-03-04 02:27:33,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 265 transitions, 1738 flow [2025-03-04 02:27:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:27:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:27:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 338 transitions. [2025-03-04 02:27:33,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-03-04 02:27:33,471 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 452 flow. Second operand 20 states and 338 transitions. [2025-03-04 02:27:33,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 265 transitions, 1738 flow [2025-03-04 02:27:33,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 265 transitions, 1708 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:33,484 INFO L231 Difference]: Finished difference. Result has 87 places, 64 transitions, 671 flow [2025-03-04 02:27:33,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=671, PETRI_PLACES=87, PETRI_TRANSITIONS=64} [2025-03-04 02:27:33,484 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 60 predicate places. [2025-03-04 02:27:33,485 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 64 transitions, 671 flow [2025-03-04 02:27:33,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 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-04 02:27:33,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:33,485 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:33,491 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-04 02:27:33,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 02:27:33,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:33,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash -607459811, now seen corresponding path program 5 times [2025-03-04 02:27:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098773705] [2025-03-04 02:27:33,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:33,693 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:27:33,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:27:33,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:33,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:34,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098773705] [2025-03-04 02:27:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098773705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:34,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614663525] [2025-03-04 02:27:34,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:34,036 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-04 02:27:34,038 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-04 02:27:34,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:27:34,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:27:34,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:34,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:34,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:27:34,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:34,324 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:27:34,324 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 23 treesize of output 10 [2025-03-04 02:27:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:34,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:34,397 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 02:27:34,398 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 25 treesize of output 13 [2025-03-04 02:27:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614663525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:34,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:34,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:27:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247857270] [2025-03-04 02:27:34,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:34,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:27:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:34,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:27:34,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:27:34,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:34,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 64 transitions, 671 flow. Second operand has 23 states, 23 states have (on average 8.217391304347826) internal successors, (189), 23 states have internal predecessors, (189), 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-04 02:27:34,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:34,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:34,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:35,557 INFO L124 PetriNetUnfolderBase]: 3352/5915 cut-off events. [2025-03-04 02:27:35,558 INFO L125 PetriNetUnfolderBase]: For 18132/18132 co-relation queries the response was YES. [2025-03-04 02:27:35,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16898 conditions, 5915 events. 3352/5915 cut-off events. For 18132/18132 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 35752 event pairs, 1277 based on Foata normal form. 5/4985 useless extension candidates. Maximal degree in co-relation 16867. Up to 2325 conditions per place. [2025-03-04 02:27:35,583 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 140 selfloop transitions, 27 changer transitions 28/198 dead transitions. [2025-03-04 02:27:35,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 198 transitions, 1616 flow [2025-03-04 02:27:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:27:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:27:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 239 transitions. [2025-03-04 02:27:35,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-03-04 02:27:35,585 INFO L175 Difference]: Start difference. First operand has 87 places, 64 transitions, 671 flow. Second operand 15 states and 239 transitions. [2025-03-04 02:27:35,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 198 transitions, 1616 flow [2025-03-04 02:27:35,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 198 transitions, 1390 flow, removed 84 selfloop flow, removed 9 redundant places. [2025-03-04 02:27:35,621 INFO L231 Difference]: Finished difference. Result has 92 places, 71 transitions, 650 flow [2025-03-04 02:27:35,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=650, PETRI_PLACES=92, PETRI_TRANSITIONS=71} [2025-03-04 02:27:35,621 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 65 predicate places. [2025-03-04 02:27:35,621 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 71 transitions, 650 flow [2025-03-04 02:27:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.217391304347826) internal successors, (189), 23 states have internal predecessors, (189), 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-04 02:27:35,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:35,622 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:35,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:27:35,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:35,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1532064159, now seen corresponding path program 6 times [2025-03-04 02:27:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952151737] [2025-03-04 02:27:35,825 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:35,831 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 02:27:35,842 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:27:35,846 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:27:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952151737] [2025-03-04 02:27:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952151737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658610937] [2025-03-04 02:27:35,936 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:35,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:35,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:35,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:35,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:27:35,973 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 02:27:35,990 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:27:35,990 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:27:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:35,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:27:35,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:36,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:36,199 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:27:36,199 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 24 treesize of output 11 [2025-03-04 02:27:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658610937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:36,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 02:27:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699180754] [2025-03-04 02:27:36,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:36,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:27:36,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:36,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:27:36,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:27:36,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:27:36,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 71 transitions, 650 flow. Second operand has 15 states, 15 states have (on average 9.933333333333334) internal successors, (149), 15 states have internal predecessors, (149), 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-04 02:27:36,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:36,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:27:36,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:37,218 INFO L124 PetriNetUnfolderBase]: 5411/9456 cut-off events. [2025-03-04 02:27:37,218 INFO L125 PetriNetUnfolderBase]: For 23665/23665 co-relation queries the response was YES. [2025-03-04 02:27:37,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 9456 events. 5411/9456 cut-off events. For 23665/23665 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 60484 event pairs, 672 based on Foata normal form. 49/8008 useless extension candidates. Maximal degree in co-relation 25939. Up to 1725 conditions per place. [2025-03-04 02:27:37,257 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 0 selfloop transitions, 0 changer transitions 220/220 dead transitions. [2025-03-04 02:27:37,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 220 transitions, 1756 flow [2025-03-04 02:27:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:27:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:27:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2025-03-04 02:27:37,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291208791208791 [2025-03-04 02:27:37,259 INFO L175 Difference]: Start difference. First operand has 92 places, 71 transitions, 650 flow. Second operand 13 states and 229 transitions. [2025-03-04 02:27:37,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 220 transitions, 1756 flow [2025-03-04 02:27:37,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 220 transitions, 1547 flow, removed 46 selfloop flow, removed 17 redundant places. [2025-03-04 02:27:37,283 INFO L231 Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow [2025-03-04 02:27:37,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0} [2025-03-04 02:27:37,283 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2025-03-04 02:27:37,283 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow [2025-03-04 02:27:37,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.933333333333334) internal successors, (149), 15 states have internal predecessors, (149), 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-04 02:27:37,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:27:37,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:27:37,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:27:37,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:37,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:37,491 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2025-03-04 02:27:37,493 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:27:37,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:27:37,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:27:37 BasicIcfg [2025-03-04 02:27:37,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:27:37,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:27:37,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:27:37,500 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:27:37,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:27" (3/4) ... [2025-03-04 02:27:37,502 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:27:37,505 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:27:37,505 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:27:37,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2025-03-04 02:27:37,511 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 02:27:37,511 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 02:27:37,511 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:27:37,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:27:37,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:27:37,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:27:37,577 INFO L158 Benchmark]: Toolchain (without parser) took 10622.15ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 110.2MB in the beginning and 197.7MB in the end (delta: -87.5MB). Peak memory consumption was 382.1MB. Max. memory is 16.1GB. [2025-03-04 02:27:37,577 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:27:37,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.76ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 98.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:27:37,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.08ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:27:37,578 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 95.5MB in the end (delta: 953.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:27:37,579 INFO L158 Benchmark]: IcfgBuilder took 462.64ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 61.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:27:37,579 INFO L158 Benchmark]: TraceAbstraction took 9840.47ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 61.9MB in the beginning and 204.6MB in the end (delta: -142.6MB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. [2025-03-04 02:27:37,580 INFO L158 Benchmark]: Witness Printer took 76.56ms. Allocated memory is still 612.4MB. Free memory was 204.6MB in the beginning and 197.7MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:27:37,583 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.76ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 98.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.08ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 95.5MB in the end (delta: 953.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 462.64ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 61.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9840.47ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 61.9MB in the beginning and 204.6MB in the end (delta: -142.6MB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. * Witness Printer took 76.56ms. Allocated memory is still 612.4MB. Free memory was 204.6MB in the beginning and 197.7MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1156 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2363 IncrementalHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 0 mSDtfsCounter, 2363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=671occurred in iteration=8, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 380 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 484 ConstructedInterpolants, 34 QuantifiedInterpolants, 4956 SizeOfPredicates, 41 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 41/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:27:37,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE