./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3.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/bench-exp3x3.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 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:17:00,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:17:00,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:17:00,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:17:00,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:17:00,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:17:00,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:17:00,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:17:00,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:17:00,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:17:00,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:17:00,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:17:00,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:17:00,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:17:00,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:17:00,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:17:00,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:17:00,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:17:00,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:17:00,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:17:00,891 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 -> 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 [2025-03-04 02:17:01,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:17:01,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:17:01,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:17:01,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:17:01,125 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:17:01,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2025-03-04 02:17:02,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210393494/51a9b99825db4aff8ad0c59bb26cc20d/FLAG1e21d78ca [2025-03-04 02:17:02,520 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:17:02,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2025-03-04 02:17:02,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210393494/51a9b99825db4aff8ad0c59bb26cc20d/FLAG1e21d78ca [2025-03-04 02:17:02,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210393494/51a9b99825db4aff8ad0c59bb26cc20d [2025-03-04 02:17:02,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:17:02,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:17:02,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:17:02,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:17:02,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:17:02,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53176590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02, skipping insertion in model container [2025-03-04 02:17:02,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:17:02,667 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/bench-exp3x3.wvr.c[2703,2716] [2025-03-04 02:17:02,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:17:02,678 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:17:02,694 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/bench-exp3x3.wvr.c[2703,2716] [2025-03-04 02:17:02,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:17:02,706 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:17:02,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02 WrapperNode [2025-03-04 02:17:02,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:17:02,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:17:02,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:17:02,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:17:02,711 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:17:02" (1/1) ... [2025-03-04 02:17:02,715 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:17:02" (1/1) ... [2025-03-04 02:17:02,725 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-03-04 02:17:02,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:17:02,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:17:02,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:17:02,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:17:02,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,742 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:17:02,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:17:02,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:17:02,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:17:02,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:17:02,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (1/1) ... [2025-03-04 02:17:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:17:02,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:02,775 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:17:02,777 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:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-04 02:17:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:17:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:17:02,794 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:17:02,855 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:17:02,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:17:03,041 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:17:03,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:17:03,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:17:03,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:17:03,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:17:03 BoogieIcfgContainer [2025-03-04 02:17:03,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:17:03,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:17:03,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:17:03,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:17:03,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:17:02" (1/3) ... [2025-03-04 02:17:03,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e87cec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:17:03, skipping insertion in model container [2025-03-04 02:17:03,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:02" (2/3) ... [2025-03-04 02:17:03,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e87cec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:17:03, skipping insertion in model container [2025-03-04 02:17:03,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:17:03" (3/3) ... [2025-03-04 02:17:03,170 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2025-03-04 02:17:03,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:17:03,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3.wvr.c that has 7 procedures, 41 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:17:03,182 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:17:03,235 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-04 02:17:03,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 134 flow [2025-03-04 02:17:03,291 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-04 02:17:03,293 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:17:03,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-04 02:17:03,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 134 flow [2025-03-04 02:17:03,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 114 flow [2025-03-04 02:17:03,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:17:03,314 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;@4d5d62ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:17:03,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:17:03,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:17:03,334 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-04 02:17:03,334 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:17:03,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:03,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:03,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2101847798, now seen corresponding path program 1 times [2025-03-04 02:17:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856261350] [2025-03-04 02:17:03,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:17:03,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:17:03,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:03,851 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:17:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856261350] [2025-03-04 02:17:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856261350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:17:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91263642] [2025-03-04 02:17:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:03,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:17:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:03,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:17:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:17:03,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:03,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:17:03,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:03,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:03,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:05,041 INFO L124 PetriNetUnfolderBase]: 18895/21812 cut-off events. [2025-03-04 02:17:05,041 INFO L125 PetriNetUnfolderBase]: For 1449/1449 co-relation queries the response was YES. [2025-03-04 02:17:05,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44837 conditions, 21812 events. 18895/21812 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 69813 event pairs, 1570 based on Foata normal form. 1/11968 useless extension candidates. Maximal degree in co-relation 38647. Up to 20725 conditions per place. [2025-03-04 02:17:05,142 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 53 selfloop transitions, 7 changer transitions 1/68 dead transitions. [2025-03-04 02:17:05,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow [2025-03-04 02:17:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:17:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:17:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-04 02:17:05,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7318840579710145 [2025-03-04 02:17:05,151 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 114 flow. Second operand 3 states and 101 transitions. [2025-03-04 02:17:05,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow [2025-03-04 02:17:05,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 281 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 02:17:05,165 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 137 flow [2025-03-04 02:17:05,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2025-03-04 02:17:05,168 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2025-03-04 02:17:05,168 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 137 flow [2025-03-04 02:17:05,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:17:05,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:05,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:05,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:17:05,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:05,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1163329501, now seen corresponding path program 1 times [2025-03-04 02:17:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691675741] [2025-03-04 02:17:05,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:05,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:05,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:05,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:05,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:05,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:05,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691675741] [2025-03-04 02:17:05,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691675741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:05,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:05,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:17:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743000837] [2025-03-04 02:17:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:05,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:17:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:05,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:17:05,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:17:05,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:05,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:05,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:05,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:05,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:06,580 INFO L124 PetriNetUnfolderBase]: 23775/27624 cut-off events. [2025-03-04 02:17:06,581 INFO L125 PetriNetUnfolderBase]: For 7875/7875 co-relation queries the response was YES. [2025-03-04 02:17:06,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68636 conditions, 27624 events. 23775/27624 cut-off events. For 7875/7875 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 96041 event pairs, 1821 based on Foata normal form. 390/27954 useless extension candidates. Maximal degree in co-relation 18833. Up to 12211 conditions per place. [2025-03-04 02:17:06,675 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 105 selfloop transitions, 10 changer transitions 0/122 dead transitions. [2025-03-04 02:17:06,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 122 transitions, 591 flow [2025-03-04 02:17:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-04 02:17:06,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2025-03-04 02:17:06,677 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 137 flow. Second operand 5 states and 170 transitions. [2025-03-04 02:17:06,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 122 transitions, 591 flow [2025-03-04 02:17:06,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 122 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:17:06,679 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 195 flow [2025-03-04 02:17:06,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2025-03-04 02:17:06,680 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-04 02:17:06,680 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 195 flow [2025-03-04 02:17:06,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:06,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:06,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:06,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:17:06,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:06,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 53155020, now seen corresponding path program 1 times [2025-03-04 02:17:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:06,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000813360] [2025-03-04 02:17:06,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:06,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:06,791 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:17:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000813360] [2025-03-04 02:17:06,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000813360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385047649] [2025-03-04 02:17:06,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:06,795 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:17:06,796 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:17:06,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:06,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:06,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:06,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:06,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:17:06,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:07,007 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:17:07,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:07,054 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:17:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385047649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:07,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:17:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120678716] [2025-03-04 02:17:07,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:07,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:07,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:07,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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:17:07,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:07,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:07,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:08,726 INFO L124 PetriNetUnfolderBase]: 31931/37769 cut-off events. [2025-03-04 02:17:08,726 INFO L125 PetriNetUnfolderBase]: For 32928/32931 co-relation queries the response was YES. [2025-03-04 02:17:08,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109484 conditions, 37769 events. 31931/37769 cut-off events. For 32928/32931 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 148835 event pairs, 4697 based on Foata normal form. 768/38274 useless extension candidates. Maximal degree in co-relation 55485. Up to 18184 conditions per place. [2025-03-04 02:17:08,879 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 122 selfloop transitions, 8 changer transitions 0/137 dead transitions. [2025-03-04 02:17:08,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 137 transitions, 796 flow [2025-03-04 02:17:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-03-04 02:17:08,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7217391304347827 [2025-03-04 02:17:08,881 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 195 flow. Second operand 5 states and 166 transitions. [2025-03-04 02:17:08,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 137 transitions, 796 flow [2025-03-04 02:17:08,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 137 transitions, 796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:17:08,886 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 250 flow [2025-03-04 02:17:08,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2025-03-04 02:17:08,886 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-03-04 02:17:08,886 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 250 flow [2025-03-04 02:17:08,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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:17:08,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:08,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:08,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:17:09,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:09,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 675555067, now seen corresponding path program 1 times [2025-03-04 02:17:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4417212] [2025-03-04 02:17:09,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:09,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:09,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:09,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4417212] [2025-03-04 02:17:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4417212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:17:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094743753] [2025-03-04 02:17:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:17:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:09,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:17:09,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:17:09,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:09,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:09,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:09,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:09,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:10,567 INFO L124 PetriNetUnfolderBase]: 32108/37898 cut-off events. [2025-03-04 02:17:10,567 INFO L125 PetriNetUnfolderBase]: For 50028/50031 co-relation queries the response was YES. [2025-03-04 02:17:10,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125269 conditions, 37898 events. 32108/37898 cut-off events. For 50028/50031 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 147018 event pairs, 1540 based on Foata normal form. 437/38264 useless extension candidates. Maximal degree in co-relation 65336. Up to 16735 conditions per place. [2025-03-04 02:17:10,741 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 127 selfloop transitions, 10 changer transitions 0/144 dead transitions. [2025-03-04 02:17:10,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 144 transitions, 907 flow [2025-03-04 02:17:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-04 02:17:10,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7043478260869566 [2025-03-04 02:17:10,745 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 250 flow. Second operand 5 states and 162 transitions. [2025-03-04 02:17:10,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 144 transitions, 907 flow [2025-03-04 02:17:10,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 144 transitions, 907 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:17:10,837 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 313 flow [2025-03-04 02:17:10,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2025-03-04 02:17:10,838 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-03-04 02:17:10,838 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 313 flow [2025-03-04 02:17:10,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:10,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:10,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:17:10,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:10,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 823122092, now seen corresponding path program 1 times [2025-03-04 02:17:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:10,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042600803] [2025-03-04 02:17:10,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:10,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:10,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:10,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:10,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:10,902 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:17:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042600803] [2025-03-04 02:17:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042600803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317007434] [2025-03-04 02:17:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:10,904 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:17:10,906 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:17:10,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:10,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:10,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:10,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:10,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:17:10,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:11,085 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:17:11,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:11,150 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:17:11,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317007434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:11,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:17:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340011635] [2025-03-04 02:17:11,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:11,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:11,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:11,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:11,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:17:11,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:11,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:11,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:13,757 INFO L124 PetriNetUnfolderBase]: 42463/51137 cut-off events. [2025-03-04 02:17:13,757 INFO L125 PetriNetUnfolderBase]: For 103986/104037 co-relation queries the response was YES. [2025-03-04 02:17:13,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181729 conditions, 51137 events. 42463/51137 cut-off events. For 103986/104037 co-relation queries the response was YES. Maximal size of possible extension queue 1962. Compared 225801 event pairs, 6740 based on Foata normal form. 922/51396 useless extension candidates. Maximal degree in co-relation 96368. Up to 22788 conditions per place. [2025-03-04 02:17:13,982 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 149 selfloop transitions, 8 changer transitions 0/164 dead transitions. [2025-03-04 02:17:13,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 164 transitions, 1211 flow [2025-03-04 02:17:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-03-04 02:17:13,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6782608695652174 [2025-03-04 02:17:13,983 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 313 flow. Second operand 5 states and 156 transitions. [2025-03-04 02:17:13,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 164 transitions, 1211 flow [2025-03-04 02:17:14,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 164 transitions, 1163 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-04 02:17:14,037 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 353 flow [2025-03-04 02:17:14,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-03-04 02:17:14,038 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-03-04 02:17:14,038 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 353 flow [2025-03-04 02:17:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:17:14,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:14,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:14,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:14,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -95711549, now seen corresponding path program 1 times [2025-03-04 02:17:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097893231] [2025-03-04 02:17:14,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:14,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:14,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:14,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:14,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097893231] [2025-03-04 02:17:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097893231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:17:14,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583169765] [2025-03-04 02:17:14,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:17:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:14,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:17:14,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:17:14,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:14,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:14,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:14,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:14,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:16,547 INFO L124 PetriNetUnfolderBase]: 42005/50527 cut-off events. [2025-03-04 02:17:16,547 INFO L125 PetriNetUnfolderBase]: For 111070/111121 co-relation queries the response was YES. [2025-03-04 02:17:16,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197625 conditions, 50527 events. 42005/50527 cut-off events. For 111070/111121 co-relation queries the response was YES. Maximal size of possible extension queue 1930. Compared 217361 event pairs, 2106 based on Foata normal form. 470/50638 useless extension candidates. Maximal degree in co-relation 126272. Up to 22330 conditions per place. [2025-03-04 02:17:16,993 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 157 selfloop transitions, 10 changer transitions 0/174 dead transitions. [2025-03-04 02:17:16,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 174 transitions, 1306 flow [2025-03-04 02:17:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-04 02:17:16,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2025-03-04 02:17:16,994 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 353 flow. Second operand 5 states and 154 transitions. [2025-03-04 02:17:16,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 174 transitions, 1306 flow [2025-03-04 02:17:17,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 174 transitions, 1306 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:17:17,337 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 416 flow [2025-03-04 02:17:17,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=416, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2025-03-04 02:17:17,337 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-03-04 02:17:17,337 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 416 flow [2025-03-04 02:17:17,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:17,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:17,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:17:17,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -292655619, now seen corresponding path program 2 times [2025-03-04 02:17:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305055058] [2025-03-04 02:17:17,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:17,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:17,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:17,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:17,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:17,404 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:17:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305055058] [2025-03-04 02:17:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305055058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606944103] [2025-03-04 02:17:17,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:17,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:17,406 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:17:17,408 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:17:17,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:17,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:17,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:17,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:17:17,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:17,622 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:17:17,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:17,689 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:17:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606944103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:17,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:17:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030168973] [2025-03-04 02:17:17,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:17,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:17,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:17,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:17,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:17:17,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:17,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:17,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:20,228 INFO L124 PetriNetUnfolderBase]: 41101/49775 cut-off events. [2025-03-04 02:17:20,228 INFO L125 PetriNetUnfolderBase]: For 118719/118770 co-relation queries the response was YES. [2025-03-04 02:17:20,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203656 conditions, 49775 events. 41101/49775 cut-off events. For 118719/118770 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 222946 event pairs, 6300 based on Foata normal form. 916/50180 useless extension candidates. Maximal degree in co-relation 130111. Up to 28331 conditions per place. [2025-03-04 02:17:20,529 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 149 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-03-04 02:17:20,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 166 transitions, 1276 flow [2025-03-04 02:17:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-03-04 02:17:20,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6565217391304348 [2025-03-04 02:17:20,530 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 416 flow. Second operand 5 states and 151 transitions. [2025-03-04 02:17:20,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 166 transitions, 1276 flow [2025-03-04 02:17:21,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 166 transitions, 1261 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:17:21,029 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 455 flow [2025-03-04 02:17:21,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2025-03-04 02:17:21,030 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-03-04 02:17:21,030 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 455 flow [2025-03-04 02:17:21,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:17:21,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:21,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:21,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:21,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:21,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:21,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash -293951322, now seen corresponding path program 2 times [2025-03-04 02:17:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913205902] [2025-03-04 02:17:21,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:21,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:21,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:21,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:21,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913205902] [2025-03-04 02:17:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913205902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:17:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12520106] [2025-03-04 02:17:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:17:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:21,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:17:21,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:17:21,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:21,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:21,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:21,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:21,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:23,628 INFO L124 PetriNetUnfolderBase]: 36739/44333 cut-off events. [2025-03-04 02:17:23,628 INFO L125 PetriNetUnfolderBase]: For 114361/114412 co-relation queries the response was YES. [2025-03-04 02:17:23,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188901 conditions, 44333 events. 36739/44333 cut-off events. For 114361/114412 co-relation queries the response was YES. Maximal size of possible extension queue 1627. Compared 188519 event pairs, 2118 based on Foata normal form. 464/44438 useless extension candidates. Maximal degree in co-relation 167195. Up to 19760 conditions per place. [2025-03-04 02:17:23,844 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 159 selfloop transitions, 9 changer transitions 0/175 dead transitions. [2025-03-04 02:17:23,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 175 transitions, 1364 flow [2025-03-04 02:17:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-04 02:17:23,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2025-03-04 02:17:23,845 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 455 flow. Second operand 5 states and 154 transitions. [2025-03-04 02:17:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 175 transitions, 1364 flow [2025-03-04 02:17:24,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 175 transitions, 1344 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:17:24,398 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 450 flow [2025-03-04 02:17:24,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=450, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-03-04 02:17:24,399 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2025-03-04 02:17:24,399 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 450 flow [2025-03-04 02:17:24,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:24,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:24,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:24,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:17:24,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2055836910, now seen corresponding path program 2 times [2025-03-04 02:17:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255741524] [2025-03-04 02:17:24,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:24,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:24,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:24,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255741524] [2025-03-04 02:17:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255741524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:17:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667300343] [2025-03-04 02:17:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:24,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:17:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:24,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:17:24,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:17:24,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:24,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:24,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:24,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:24,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:26,390 INFO L124 PetriNetUnfolderBase]: 31943/38259 cut-off events. [2025-03-04 02:17:26,390 INFO L125 PetriNetUnfolderBase]: For 114058/114133 co-relation queries the response was YES. [2025-03-04 02:17:26,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164784 conditions, 38259 events. 31943/38259 cut-off events. For 114058/114133 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 158072 event pairs, 1947 based on Foata normal form. 504/38708 useless extension candidates. Maximal degree in co-relation 145344. Up to 16948 conditions per place. [2025-03-04 02:17:26,628 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 174 selfloop transitions, 9 changer transitions 0/190 dead transitions. [2025-03-04 02:17:26,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 190 transitions, 1547 flow [2025-03-04 02:17:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-04 02:17:26,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7043478260869566 [2025-03-04 02:17:26,629 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 450 flow. Second operand 5 states and 162 transitions. [2025-03-04 02:17:26,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 190 transitions, 1547 flow [2025-03-04 02:17:26,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 190 transitions, 1510 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-04 02:17:26,906 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 454 flow [2025-03-04 02:17:26,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2025-03-04 02:17:26,907 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2025-03-04 02:17:26,907 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 454 flow [2025-03-04 02:17:26,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:26,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:26,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:26,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:17:26,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:26,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1951717229, now seen corresponding path program 2 times [2025-03-04 02:17:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105503178] [2025-03-04 02:17:26,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:26,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:26,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:26,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:26,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:26,982 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:17:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105503178] [2025-03-04 02:17:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105503178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918944641] [2025-03-04 02:17:26,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:26,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:26,984 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:17:26,986 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:17:27,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:27,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:27,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:27,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:27,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:17:27,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:27,328 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:17:27,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:27,392 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:17:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918944641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:27,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:17:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954057177] [2025-03-04 02:17:27,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:27,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:27,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:27,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:27,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:27,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:17:27,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:27,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:27,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:29,585 INFO L124 PetriNetUnfolderBase]: 30959/37431 cut-off events. [2025-03-04 02:17:29,585 INFO L125 PetriNetUnfolderBase]: For 108476/108767 co-relation queries the response was YES. [2025-03-04 02:17:29,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165356 conditions, 37431 events. 30959/37431 cut-off events. For 108476/108767 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 161941 event pairs, 5914 based on Foata normal form. 1032/38264 useless extension candidates. Maximal degree in co-relation 149296. Up to 20603 conditions per place. [2025-03-04 02:17:29,767 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 168 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2025-03-04 02:17:29,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 183 transitions, 1480 flow [2025-03-04 02:17:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2025-03-04 02:17:29,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.691304347826087 [2025-03-04 02:17:29,768 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 454 flow. Second operand 5 states and 159 transitions. [2025-03-04 02:17:29,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 183 transitions, 1480 flow [2025-03-04 02:17:29,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 183 transitions, 1471 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:17:29,940 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 495 flow [2025-03-04 02:17:29,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-04 02:17:29,940 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2025-03-04 02:17:29,940 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 495 flow [2025-03-04 02:17:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:17:29,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:29,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:29,946 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:17:30,141 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:17:30,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash -432419245, now seen corresponding path program 1 times [2025-03-04 02:17:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527160821] [2025-03-04 02:17:30,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:30,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:30,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:30,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:30,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:30,192 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:17:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527160821] [2025-03-04 02:17:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527160821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730138992] [2025-03-04 02:17:30,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:30,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:30,194 INFO L229 MonitoredProcess]: Starting monitored process 6 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:17:30,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:17:30,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:17:30,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:30,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:30,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:30,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:17:30,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:30,292 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:17:30,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:30,314 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:17:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730138992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:30,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:30,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:17:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270792206] [2025-03-04 02:17:30,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:30,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:30,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:30,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:30,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:30,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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:17:30,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:30,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:30,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:32,696 INFO L124 PetriNetUnfolderBase]: 34557/42201 cut-off events. [2025-03-04 02:17:32,696 INFO L125 PetriNetUnfolderBase]: For 149994/150266 co-relation queries the response was YES. [2025-03-04 02:17:32,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197401 conditions, 42201 events. 34557/42201 cut-off events. For 149994/150266 co-relation queries the response was YES. Maximal size of possible extension queue 1546. Compared 195733 event pairs, 7642 based on Foata normal form. 1024/43022 useless extension candidates. Maximal degree in co-relation 178084. Up to 19791 conditions per place. [2025-03-04 02:17:33,096 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 205 selfloop transitions, 10 changer transitions 0/222 dead transitions. [2025-03-04 02:17:33,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 222 transitions, 1893 flow [2025-03-04 02:17:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-04 02:17:33,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7652173913043478 [2025-03-04 02:17:33,097 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 495 flow. Second operand 5 states and 176 transitions. [2025-03-04 02:17:33,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 222 transitions, 1893 flow [2025-03-04 02:17:33,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 222 transitions, 1831 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-04 02:17:33,291 INFO L231 Difference]: Finished difference. Result has 92 places, 79 transitions, 531 flow [2025-03-04 02:17:33,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=92, PETRI_TRANSITIONS=79} [2025-03-04 02:17:33,292 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2025-03-04 02:17:33,292 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 79 transitions, 531 flow [2025-03-04 02:17:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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:17:33,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:33,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:33,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:33,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:17:33,497 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1950783647, now seen corresponding path program 2 times [2025-03-04 02:17:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590967018] [2025-03-04 02:17:33,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:33,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:33,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:33,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:33,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590967018] [2025-03-04 02:17:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590967018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:33,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:17:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124384698] [2025-03-04 02:17:33,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:33,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:17:33,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:33,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:17:33,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:17:33,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:33,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 79 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:33,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:33,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:33,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:35,536 INFO L124 PetriNetUnfolderBase]: 29565/35852 cut-off events. [2025-03-04 02:17:35,537 INFO L125 PetriNetUnfolderBase]: For 140833/140901 co-relation queries the response was YES. [2025-03-04 02:17:35,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173061 conditions, 35852 events. 29565/35852 cut-off events. For 140833/140901 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 157035 event pairs, 2545 based on Foata normal form. 429/36229 useless extension candidates. Maximal degree in co-relation 156520. Up to 16532 conditions per place. [2025-03-04 02:17:35,794 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 204 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2025-03-04 02:17:35,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 220 transitions, 1886 flow [2025-03-04 02:17:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-04 02:17:35,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2025-03-04 02:17:35,795 INFO L175 Difference]: Start difference. First operand has 92 places, 79 transitions, 531 flow. Second operand 5 states and 170 transitions. [2025-03-04 02:17:35,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 220 transitions, 1886 flow [2025-03-04 02:17:36,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 220 transitions, 1877 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:17:36,190 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 535 flow [2025-03-04 02:17:36,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=535, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2025-03-04 02:17:36,191 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2025-03-04 02:17:36,191 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 535 flow [2025-03-04 02:17:36,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17:36,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:36,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:36,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:17:36,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:17:36,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1909210203, now seen corresponding path program 2 times [2025-03-04 02:17:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549812109] [2025-03-04 02:17:36,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:36,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:36,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:36,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:36,261 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:17:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549812109] [2025-03-04 02:17:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549812109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735715329] [2025-03-04 02:17:36,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:36,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:36,264 INFO L229 MonitoredProcess]: Starting monitored process 7 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:17:36,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:17:36,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:17:36,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:17:36,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:36,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:36,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:17:36,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:36,460 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:17:36,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:36,531 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:17:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735715329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:36,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:36,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:17:36,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703812660] [2025-03-04 02:17:36,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:36,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:36,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:36,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:17:36,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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:17:36,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:36,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:17:36,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand