./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.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 d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:45:25,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:45:25,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:45:25,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:45:25,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:45:25,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:45:25,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:45:25,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:45:25,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:45:25,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:45:25,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:45:25,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:45:25,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:45:25,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:45:25,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:45:25,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:45:25,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:45:25,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:45:25,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:45:25,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:45:25,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:45:25,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:45:25,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:45:25,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:45:25,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:45:25,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:45:25,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:45:25,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:45:25,802 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 -> d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 [2025-03-17 06:45:26,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:45:26,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:45:26,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:45:26,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:45:26,040 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:45:26,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-17 06:45:27,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1328d1c58/603d511ef2ce4c4ca44dd9f0d6818d8d/FLAGdee2d6818 [2025-03-17 06:45:27,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:45:27,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-17 06:45:27,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1328d1c58/603d511ef2ce4c4ca44dd9f0d6818d8d/FLAGdee2d6818 [2025-03-17 06:45:27,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1328d1c58/603d511ef2ce4c4ca44dd9f0d6818d8d [2025-03-17 06:45:27,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:45:27,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:45:27,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:45:27,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:45:27,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:45:27,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:27,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58691968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27, skipping insertion in model container [2025-03-17 06:45:27,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:27,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:45:27,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-17 06:45:27,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:45:27,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:45:27,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-17 06:45:27,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:45:27,968 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:45:27,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27 WrapperNode [2025-03-17 06:45:27,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:45:27,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:45:27,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:45:27,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:45:27,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:27,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:27,988 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 134 [2025-03-17 06:45:27,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:45:27,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:45:27,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:45:27,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:45:27,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:27,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:27,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,004 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 06:45:28,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:45:28,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:45:28,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:45:28,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:45:28,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (1/1) ... [2025-03-17 06:45:28,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:45:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:28,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:45:28,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:45:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:45:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:45:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:45:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:45:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:45:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:45:28,058 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:45:28,141 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:45:28,142 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:45:28,375 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:45:28,375 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:45:28,531 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:45:28,531 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:45:28,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:45:28 BoogieIcfgContainer [2025-03-17 06:45:28,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:45:28,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:45:28,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:45:28,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:45:28,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:45:27" (1/3) ... [2025-03-17 06:45:28,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198c0fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:45:28, skipping insertion in model container [2025-03-17 06:45:28,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:45:27" (2/3) ... [2025-03-17 06:45:28,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198c0fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:45:28, skipping insertion in model container [2025-03-17 06:45:28,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:45:28" (3/3) ... [2025-03-17 06:45:28,538 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-03-17 06:45:28,553 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:45:28,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-17 06:45:28,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:45:28,601 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 06:45:28,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 78 flow [2025-03-17 06:45:28,650 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2025-03-17 06:45:28,653 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:45:28,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-17 06:45:28,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 78 flow [2025-03-17 06:45:28,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 70 flow [2025-03-17 06:45:28,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:45:28,675 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;@3d040522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:45:28,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-17 06:45:28,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:45:28,682 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-17 06:45:28,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:45:28,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:28,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:28,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:28,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1916177356, now seen corresponding path program 1 times [2025-03-17 06:45:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121919366] [2025-03-17 06:45:28,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:28,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 06:45:28,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:45:28,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:28,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121919366] [2025-03-17 06:45:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121919366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:45:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669175164] [2025-03-17 06:45:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:28,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:45:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:28,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:45:28,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:45:28,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:28,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:28,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:28,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:28,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:28,995 INFO L124 PetriNetUnfolderBase]: 158/290 cut-off events. [2025-03-17 06:45:28,995 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 06:45:28,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 290 events. 158/290 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1046 event pairs, 116 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 513. Up to 253 conditions per place. [2025-03-17 06:45:28,999 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 22 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-03-17 06:45:28,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 110 flow [2025-03-17 06:45:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:45:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 06:45:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2025-03-17 06:45:29,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-17 06:45:29,008 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 70 flow. Second operand 2 states and 38 transitions. [2025-03-17 06:45:29,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 110 flow [2025-03-17 06:45:29,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 06:45:29,012 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 58 flow [2025-03-17 06:45:29,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-03-17 06:45:29,016 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-03-17 06:45:29,016 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 58 flow [2025-03-17 06:45:29,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:29,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:29,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:45:29,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:29,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 307249794, now seen corresponding path program 1 times [2025-03-17 06:45:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044225117] [2025-03-17 06:45:29,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:29,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:45:29,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:45:29,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:29,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:29,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:29,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044225117] [2025-03-17 06:45:29,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044225117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:29,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:45:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484714977] [2025-03-17 06:45:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:29,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:45:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:29,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:45:29,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:45:29,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:29,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:29,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:29,267 INFO L124 PetriNetUnfolderBase]: 256/457 cut-off events. [2025-03-17 06:45:29,267 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 06:45:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 457 events. 256/457 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1866 event pairs, 96 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 893. Up to 228 conditions per place. [2025-03-17 06:45:29,272 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 34 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2025-03-17 06:45:29,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 44 transitions, 173 flow [2025-03-17 06:45:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:45:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:45:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-17 06:45:29,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-03-17 06:45:29,276 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 58 flow. Second operand 3 states and 61 transitions. [2025-03-17 06:45:29,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 44 transitions, 173 flow [2025-03-17 06:45:29,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:45:29,278 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 70 flow [2025-03-17 06:45:29,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2025-03-17 06:45:29,280 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-03-17 06:45:29,280 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 70 flow [2025-03-17 06:45:29,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:29,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:29,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:45:29,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:29,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash 119303630, now seen corresponding path program 1 times [2025-03-17 06:45:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523637187] [2025-03-17 06:45:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:29,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:45:29,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:45:29,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:29,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523637187] [2025-03-17 06:45:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523637187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:45:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308875251] [2025-03-17 06:45:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:29,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:45:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:29,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:45:29,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:45:29,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:29,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:29,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:29,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:29,490 INFO L124 PetriNetUnfolderBase]: 287/534 cut-off events. [2025-03-17 06:45:29,490 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 06:45:29,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 534 events. 287/534 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2131 event pairs, 126 based on Foata normal form. 14/459 useless extension candidates. Maximal degree in co-relation 1051. Up to 318 conditions per place. [2025-03-17 06:45:29,492 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 27 selfloop transitions, 3 changer transitions 6/41 dead transitions. [2025-03-17 06:45:29,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 170 flow [2025-03-17 06:45:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:45:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:45:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 06:45:29,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-17 06:45:29,493 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 70 flow. Second operand 3 states and 57 transitions. [2025-03-17 06:45:29,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 170 flow [2025-03-17 06:45:29,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:45:29,494 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 87 flow [2025-03-17 06:45:29,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-03-17 06:45:29,495 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-03-17 06:45:29,495 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 87 flow [2025-03-17 06:45:29,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:29,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:29,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:45:29,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1954711074, now seen corresponding path program 1 times [2025-03-17 06:45:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:29,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598521245] [2025-03-17 06:45:29,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:45:29,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:45:29,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:29,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598521245] [2025-03-17 06:45:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598521245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:29,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:45:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306127784] [2025-03-17 06:45:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:45:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:29,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:45:29,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:45:29,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:29,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:29,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:29,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:29,740 INFO L124 PetriNetUnfolderBase]: 355/668 cut-off events. [2025-03-17 06:45:29,740 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-17 06:45:29,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 668 events. 355/668 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2889 event pairs, 289 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 1416. Up to 480 conditions per place. [2025-03-17 06:45:29,743 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 2 changer transitions 15/46 dead transitions. [2025-03-17 06:45:29,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 205 flow [2025-03-17 06:45:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:45:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:45:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-17 06:45:29,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2025-03-17 06:45:29,744 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 87 flow. Second operand 4 states and 67 transitions. [2025-03-17 06:45:29,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 205 flow [2025-03-17 06:45:29,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:45:29,746 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 98 flow [2025-03-17 06:45:29,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-03-17 06:45:29,746 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-03-17 06:45:29,746 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 98 flow [2025-03-17 06:45:29,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:29,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:29,747 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:29,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:45:29,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:29,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:29,747 INFO L85 PathProgramCache]: Analyzing trace with hash -769177675, now seen corresponding path program 1 times [2025-03-17 06:45:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:29,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-17 06:45:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:29,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:45:29,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:45:29,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:29,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-17 06:45:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334140648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454978510] [2025-03-17 06:45:30,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:30,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:30,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:45:30,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:45:30,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:45:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:45:30,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:30,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 06:45:30,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:30,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 06:45:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:30,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:30,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-03-17 06:45:30,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:45:30,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-03-17 06:45:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454978510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:31,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-17 06:45:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854379226] [2025-03-17 06:45:31,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:31,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:45:31,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:31,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:45:31,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:45:31,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:31,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 98 flow. Second operand has 19 states, 19 states have (on average 10.31578947368421) internal successors, (196), 19 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:31,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:31,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:31,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:31,956 INFO L124 PetriNetUnfolderBase]: 1327/2516 cut-off events. [2025-03-17 06:45:31,956 INFO L125 PetriNetUnfolderBase]: For 532/532 co-relation queries the response was YES. [2025-03-17 06:45:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5381 conditions, 2516 events. 1327/2516 cut-off events. For 532/532 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15121 event pairs, 322 based on Foata normal form. 3/2240 useless extension candidates. Maximal degree in co-relation 5373. Up to 501 conditions per place. [2025-03-17 06:45:31,967 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 122 selfloop transitions, 33 changer transitions 49/209 dead transitions. [2025-03-17 06:45:31,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 209 transitions, 997 flow [2025-03-17 06:45:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:45:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 06:45:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 328 transitions. [2025-03-17 06:45:31,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-17 06:45:31,971 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 98 flow. Second operand 18 states and 328 transitions. [2025-03-17 06:45:31,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 209 transitions, 997 flow [2025-03-17 06:45:31,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 209 transitions, 971 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-17 06:45:31,979 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 364 flow [2025-03-17 06:45:31,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2025-03-17 06:45:31,980 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2025-03-17 06:45:31,980 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 364 flow [2025-03-17 06:45:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.31578947368421) internal successors, (196), 19 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:31,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:31,982 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:31,989 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-17 06:45:32,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:32,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:32,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1568139307, now seen corresponding path program 1 times [2025-03-17 06:45:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-03-17 06:45:32,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:32,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:45:32,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:45:32,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:32,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:45:32,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-03-17 06:45:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145780069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:32,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:45:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973035749] [2025-03-17 06:45:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:45:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:32,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:45:32,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:45:32,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-03-17 06:45:32,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:32,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:32,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-03-17 06:45:32,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:32,424 INFO L124 PetriNetUnfolderBase]: 1592/2828 cut-off events. [2025-03-17 06:45:32,424 INFO L125 PetriNetUnfolderBase]: For 2951/2951 co-relation queries the response was YES. [2025-03-17 06:45:32,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7307 conditions, 2828 events. 1592/2828 cut-off events. For 2951/2951 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16034 event pairs, 886 based on Foata normal form. 44/2675 useless extension candidates. Maximal degree in co-relation 7291. Up to 2031 conditions per place. [2025-03-17 06:45:32,435 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 65 selfloop transitions, 2 changer transitions 3/73 dead transitions. [2025-03-17 06:45:32,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 528 flow [2025-03-17 06:45:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:45:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:45:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-17 06:45:32,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-17 06:45:32,436 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 364 flow. Second operand 3 states and 54 transitions. [2025-03-17 06:45:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 528 flow [2025-03-17 06:45:32,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 481 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-03-17 06:45:32,449 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 268 flow [2025-03-17 06:45:32,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-17 06:45:32,450 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2025-03-17 06:45:32,450 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 268 flow [2025-03-17 06:45:32,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:32,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:32,451 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:32,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:45:32,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1777514105, now seen corresponding path program 2 times [2025-03-17 06:45:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352573523] [2025-03-17 06:45:32,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:32,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:45:32,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:45:32,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352573523] [2025-03-17 06:45:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352573523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181147247] [2025-03-17 06:45:32,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:32,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:32,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:45:32,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:45:32,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:45:32,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:45:32,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:32,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:32,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 06:45:32,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:32,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181147247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:32,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-17 06:45:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037953007] [2025-03-17 06:45:32,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:45:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:45:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:45:32,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:32,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 268 flow. Second operand has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:32,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:32,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:32,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:33,272 INFO L124 PetriNetUnfolderBase]: 1136/2184 cut-off events. [2025-03-17 06:45:33,272 INFO L125 PetriNetUnfolderBase]: For 2338/2338 co-relation queries the response was YES. [2025-03-17 06:45:33,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 2184 events. 1136/2184 cut-off events. For 2338/2338 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12986 event pairs, 652 based on Foata normal form. 26/2059 useless extension candidates. Maximal degree in co-relation 5601. Up to 1171 conditions per place. [2025-03-17 06:45:33,279 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 3 changer transitions 60/102 dead transitions. [2025-03-17 06:45:33,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 590 flow [2025-03-17 06:45:33,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:45:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:45:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2025-03-17 06:45:33,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-03-17 06:45:33,283 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 268 flow. Second operand 9 states and 145 transitions. [2025-03-17 06:45:33,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 590 flow [2025-03-17 06:45:33,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 575 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 06:45:33,290 INFO L231 Difference]: Finished difference. Result has 68 places, 42 transitions, 198 flow [2025-03-17 06:45:33,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=68, PETRI_TRANSITIONS=42} [2025-03-17 06:45:33,290 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-03-17 06:45:33,290 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 42 transitions, 198 flow [2025-03-17 06:45:33,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:33,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:33,291 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:33,298 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-17 06:45:33,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 06:45:33,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:33,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:33,495 INFO L85 PathProgramCache]: Analyzing trace with hash -641759982, now seen corresponding path program 3 times [2025-03-17 06:45:33,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:33,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137737587] [2025-03-17 06:45:33,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:45:33,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:33,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-17 06:45:33,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 30 statements. [2025-03-17 06:45:33,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:45:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 06:45:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137737587] [2025-03-17 06:45:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137737587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:45:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490727482] [2025-03-17 06:45:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:33,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:45:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:33,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:45:33,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:45:33,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:33,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-17 06:45:33,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:33,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:33,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:33,773 INFO L124 PetriNetUnfolderBase]: 782/1457 cut-off events. [2025-03-17 06:45:33,773 INFO L125 PetriNetUnfolderBase]: For 2532/2536 co-relation queries the response was YES. [2025-03-17 06:45:33,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 1457 events. 782/1457 cut-off events. For 2532/2536 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7619 event pairs, 246 based on Foata normal form. 1/1355 useless extension candidates. Maximal degree in co-relation 4027. Up to 486 conditions per place. [2025-03-17 06:45:33,779 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 8 changer transitions 10/80 dead transitions. [2025-03-17 06:45:33,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 498 flow [2025-03-17 06:45:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:45:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:45:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-17 06:45:33,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-03-17 06:45:33,781 INFO L175 Difference]: Start difference. First operand has 68 places, 42 transitions, 198 flow. Second operand 5 states and 98 transitions. [2025-03-17 06:45:33,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 498 flow [2025-03-17 06:45:33,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 422 flow, removed 35 selfloop flow, removed 11 redundant places. [2025-03-17 06:45:33,787 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 198 flow [2025-03-17 06:45:33,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-03-17 06:45:33,789 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-17 06:45:33,789 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 198 flow [2025-03-17 06:45:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-17 06:45:33,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:33,790 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:45:33,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 592577170, now seen corresponding path program 4 times [2025-03-17 06:45:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349692059] [2025-03-17 06:45:33,791 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:45:33,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:33,798 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:45:33,809 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:45:33,810 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:45:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:45:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349692059] [2025-03-17 06:45:33,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349692059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568349518] [2025-03-17 06:45:33,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:45:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:33,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:33,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:45:33,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:45:33,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:45:33,919 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:45:33,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:45:33,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:33,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:45:33,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:45:33,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:45:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568349518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:34,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:34,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2025-03-17 06:45:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229808025] [2025-03-17 06:45:34,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:45:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:34,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:45:34,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:45:34,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:34,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:34,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:34,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:34,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:34,203 INFO L124 PetriNetUnfolderBase]: 1433/2730 cut-off events. [2025-03-17 06:45:34,203 INFO L125 PetriNetUnfolderBase]: For 1885/1885 co-relation queries the response was YES. [2025-03-17 06:45:34,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6555 conditions, 2730 events. 1433/2730 cut-off events. For 1885/1885 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 15484 event pairs, 561 based on Foata normal form. 30/2584 useless extension candidates. Maximal degree in co-relation 6543. Up to 882 conditions per place. [2025-03-17 06:45:34,212 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 57 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2025-03-17 06:45:34,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 477 flow [2025-03-17 06:45:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:45:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:45:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-17 06:45:34,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-17 06:45:34,214 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 198 flow. Second operand 4 states and 80 transitions. [2025-03-17 06:45:34,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 477 flow [2025-03-17 06:45:34,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 455 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-17 06:45:34,216 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 312 flow [2025-03-17 06:45:34,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-17 06:45:34,217 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-03-17 06:45:34,218 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 312 flow [2025-03-17 06:45:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:34,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:34,218 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:34,227 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-17 06:45:34,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:34,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:34,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 399290624, now seen corresponding path program 5 times [2025-03-17 06:45:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:34,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416051863] [2025-03-17 06:45:34,421 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:45:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:34,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-03-17 06:45:34,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:34,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 06:45:34,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 06:45:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416051863] [2025-03-17 06:45:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416051863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:45:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:45:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:45:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631532765] [2025-03-17 06:45:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:45:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:45:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:34,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:45:34,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:45:34,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2025-03-17 06:45:34,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:34,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:34,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2025-03-17 06:45:34,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:34,809 INFO L124 PetriNetUnfolderBase]: 2506/4353 cut-off events. [2025-03-17 06:45:34,809 INFO L125 PetriNetUnfolderBase]: For 4156/4156 co-relation queries the response was YES. [2025-03-17 06:45:34,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11498 conditions, 4353 events. 2506/4353 cut-off events. For 4156/4156 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23414 event pairs, 437 based on Foata normal form. 220/4244 useless extension candidates. Maximal degree in co-relation 11484. Up to 2213 conditions per place. [2025-03-17 06:45:34,826 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 72 selfloop transitions, 4 changer transitions 3/81 dead transitions. [2025-03-17 06:45:34,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 645 flow [2025-03-17 06:45:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:45:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:45:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-17 06:45:34,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2025-03-17 06:45:34,827 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 312 flow. Second operand 4 states and 63 transitions. [2025-03-17 06:45:34,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 645 flow [2025-03-17 06:45:34,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 633 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-17 06:45:34,831 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 327 flow [2025-03-17 06:45:34,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-17 06:45:34,832 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-03-17 06:45:34,832 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 327 flow [2025-03-17 06:45:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:34,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:34,832 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:45:34,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -111490636, now seen corresponding path program 1 times [2025-03-17 06:45:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923440684] [2025-03-17 06:45:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:34,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:45:34,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:34,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:34,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923440684] [2025-03-17 06:45:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923440684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385510860] [2025-03-17 06:45:35,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:45:35,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:35,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:35,555 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-17 06:45:35,557 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-17 06:45:35,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:45:35,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:35,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:45:35,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:35,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 06:45:35,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:35,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 06:45:36,027 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-17 06:45:36,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-03-17 06:45:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:36,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:36,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2025-03-17 06:45:36,756 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-03-17 06:45:36,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 196 [2025-03-17 06:45:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385510860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:37,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-17 06:45:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194879076] [2025-03-17 06:45:37,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:37,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 06:45:37,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:37,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 06:45:37,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2025-03-17 06:45:37,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:37,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 327 flow. Second operand has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:37,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:37,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:37,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:39,930 INFO L124 PetriNetUnfolderBase]: 5110/9692 cut-off events. [2025-03-17 06:45:39,931 INFO L125 PetriNetUnfolderBase]: For 11823/11827 co-relation queries the response was YES. [2025-03-17 06:45:39,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26052 conditions, 9692 events. 5110/9692 cut-off events. For 11823/11827 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 66577 event pairs, 1199 based on Foata normal form. 62/9073 useless extension candidates. Maximal degree in co-relation 26035. Up to 2144 conditions per place. [2025-03-17 06:45:39,969 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 242 selfloop transitions, 80 changer transitions 63/392 dead transitions. [2025-03-17 06:45:39,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 392 transitions, 2443 flow [2025-03-17 06:45:39,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 06:45:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 06:45:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 585 transitions. [2025-03-17 06:45:39,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5539772727272727 [2025-03-17 06:45:39,971 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 327 flow. Second operand 33 states and 585 transitions. [2025-03-17 06:45:39,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 392 transitions, 2443 flow [2025-03-17 06:45:39,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 392 transitions, 2437 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 06:45:39,979 INFO L231 Difference]: Finished difference. Result has 106 places, 131 transitions, 1308 flow [2025-03-17 06:45:39,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1308, PETRI_PLACES=106, PETRI_TRANSITIONS=131} [2025-03-17 06:45:39,980 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2025-03-17 06:45:39,980 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 131 transitions, 1308 flow [2025-03-17 06:45:39,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:39,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:39,980 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:39,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:45:40,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:40,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:40,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1046820180, now seen corresponding path program 2 times [2025-03-17 06:45:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761768469] [2025-03-17 06:45:40,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:40,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 06:45:40,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:40,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:40,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761768469] [2025-03-17 06:45:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761768469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078618173] [2025-03-17 06:45:40,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:45:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:40,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:40,684 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-17 06:45:40,685 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-17 06:45:40,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 06:45:40,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:40,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:45:40,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:40,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 06:45:40,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:41,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:41,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:45:41,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-17 06:45:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078618173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:41,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:41,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-17 06:45:41,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741519331] [2025-03-17 06:45:41,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:41,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 06:45:41,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:41,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 06:45:41,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2025-03-17 06:45:41,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:41,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 131 transitions, 1308 flow. Second operand has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:41,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:43,906 INFO L124 PetriNetUnfolderBase]: 9117/17299 cut-off events. [2025-03-17 06:45:43,907 INFO L125 PetriNetUnfolderBase]: For 90009/90017 co-relation queries the response was YES. [2025-03-17 06:45:43,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58576 conditions, 17299 events. 9117/17299 cut-off events. For 90009/90017 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 134114 event pairs, 2573 based on Foata normal form. 41/16167 useless extension candidates. Maximal degree in co-relation 58542. Up to 5340 conditions per place. [2025-03-17 06:45:43,987 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 234 selfloop transitions, 65 changer transitions 182/488 dead transitions. [2025-03-17 06:45:43,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 488 transitions, 4320 flow [2025-03-17 06:45:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 06:45:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 06:45:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 550 transitions. [2025-03-17 06:45:43,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-17 06:45:43,991 INFO L175 Difference]: Start difference. First operand has 106 places, 131 transitions, 1308 flow. Second operand 30 states and 550 transitions. [2025-03-17 06:45:43,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 488 transitions, 4320 flow [2025-03-17 06:45:44,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 488 transitions, 3872 flow, removed 217 selfloop flow, removed 5 redundant places. [2025-03-17 06:45:44,073 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1333 flow [2025-03-17 06:45:44,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1333, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2025-03-17 06:45:44,074 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2025-03-17 06:45:44,074 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1333 flow [2025-03-17 06:45:44,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:44,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:44,074 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:44,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 06:45:44,279 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,SelfDestructingSolverStorable11 [2025-03-17 06:45:44,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:44,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:44,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1092147786, now seen corresponding path program 3 times [2025-03-17 06:45:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:44,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-17 06:45:44,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:45:44,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:44,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-17 06:45:44,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:44,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 06:45:44,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-17 06:45:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057101998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103941061] [2025-03-17 06:45:45,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:45:45,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:45,200 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-17 06:45:45,201 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-17 06:45:45,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-17 06:45:45,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:45:45,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 06:45:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:45,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 06:45:45,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:45,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 06:45:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:45,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:46,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2025-03-17 06:45:46,357 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-17 06:45:46,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 196 [2025-03-17 06:45:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:45:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103941061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:47,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-17 06:45:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576230202] [2025-03-17 06:45:47,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 06:45:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 06:45:47,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2025-03-17 06:45:47,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:47,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1333 flow. Second operand has 28 states, 28 states have (on average 10.0) internal successors, (280), 28 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:47,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:47,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:47,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:52,124 INFO L124 PetriNetUnfolderBase]: 15506/29277 cut-off events. [2025-03-17 06:45:52,125 INFO L125 PetriNetUnfolderBase]: For 222020/222020 co-relation queries the response was YES. [2025-03-17 06:45:52,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108750 conditions, 29277 events. 15506/29277 cut-off events. For 222020/222020 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 238743 event pairs, 3024 based on Foata normal form. 75/27375 useless extension candidates. Maximal degree in co-relation 108703. Up to 4890 conditions per place. [2025-03-17 06:45:52,401 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 338 selfloop transitions, 200 changer transitions 104/649 dead transitions. [2025-03-17 06:45:52,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 649 transitions, 6709 flow [2025-03-17 06:45:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 06:45:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-17 06:45:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 706 transitions. [2025-03-17 06:45:52,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5962837837837838 [2025-03-17 06:45:52,405 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1333 flow. Second operand 37 states and 706 transitions. [2025-03-17 06:45:52,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 649 transitions, 6709 flow [2025-03-17 06:45:52,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 649 transitions, 5720 flow, removed 475 selfloop flow, removed 20 redundant places. [2025-03-17 06:45:52,737 INFO L231 Difference]: Finished difference. Result has 167 places, 291 transitions, 3834 flow [2025-03-17 06:45:52,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3834, PETRI_PLACES=167, PETRI_TRANSITIONS=291} [2025-03-17 06:45:52,738 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2025-03-17 06:45:52,738 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 291 transitions, 3834 flow [2025-03-17 06:45:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.0) internal successors, (280), 28 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:52,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:52,738 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:52,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 06:45:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:52,939 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash 275745113, now seen corresponding path program 4 times [2025-03-17 06:45:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539157301] [2025-03-17 06:45:52,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:45:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:52,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-17 06:45:52,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:45:52,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:45:52,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:45:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:45:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539157301] [2025-03-17 06:45:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539157301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:45:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252174528] [2025-03-17 06:45:53,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:45:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:53,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:45:53,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:45:53,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 06:45:53,207 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-17 06:45:53,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:45:53,226 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:45:53,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:45:53,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 06:45:53,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:45:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:45:53,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:45:53,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:45:53,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-17 06:45:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:45:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252174528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:45:53,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:45:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 17 [2025-03-17 06:45:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052652603] [2025-03-17 06:45:53,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:45:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:45:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:45:53,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:45:53,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:45:53,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:45:53,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 291 transitions, 3834 flow. Second operand has 18 states, 18 states have (on average 11.555555555555555) internal successors, (208), 18 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:53,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:45:53,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:45:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:45:58,159 INFO L124 PetriNetUnfolderBase]: 18018/34188 cut-off events. [2025-03-17 06:45:58,159 INFO L125 PetriNetUnfolderBase]: For 439917/439917 co-relation queries the response was YES. [2025-03-17 06:45:58,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142624 conditions, 34188 events. 18018/34188 cut-off events. For 439917/439917 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 274164 event pairs, 4209 based on Foata normal form. 147/32050 useless extension candidates. Maximal degree in co-relation 142563. Up to 12874 conditions per place. [2025-03-17 06:45:58,625 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 302 selfloop transitions, 149 changer transitions 56/514 dead transitions. [2025-03-17 06:45:58,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 514 transitions, 7582 flow [2025-03-17 06:45:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:45:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 06:45:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 308 transitions. [2025-03-17 06:45:58,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6015625 [2025-03-17 06:45:58,626 INFO L175 Difference]: Start difference. First operand has 167 places, 291 transitions, 3834 flow. Second operand 16 states and 308 transitions. [2025-03-17 06:45:58,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 514 transitions, 7582 flow [2025-03-17 06:45:59,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 514 transitions, 5664 flow, removed 929 selfloop flow, removed 16 redundant places. [2025-03-17 06:45:59,471 INFO L231 Difference]: Finished difference. Result has 174 places, 324 transitions, 4083 flow [2025-03-17 06:45:59,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4083, PETRI_PLACES=174, PETRI_TRANSITIONS=324} [2025-03-17 06:45:59,472 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2025-03-17 06:45:59,472 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 324 transitions, 4083 flow [2025-03-17 06:45:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.555555555555555) internal successors, (208), 18 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:45:59,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:45:59,472 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:45:59,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 06:45:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:45:59,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:45:59,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:45:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1016657443, now seen corresponding path program 5 times [2025-03-17 06:45:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:45:59,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078656745] [2025-03-17 06:45:59,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:45:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:45:59,679 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-17 06:45:59,706 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 06:45:59,706 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 06:45:59,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078656745] [2025-03-17 06:46:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078656745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019922530] [2025-03-17 06:46:00,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:00,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:00,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:00,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:00,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 06:46:00,357 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-17 06:46:00,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 06:46:00,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 06:46:00,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:00,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 06:46:00,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:46:00,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:00,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:46:00,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-03-17 06:46:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:01,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019922530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:01,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:01,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 29 [2025-03-17 06:46:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789866417] [2025-03-17 06:46:01,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:01,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 06:46:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:01,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 06:46:01,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:46:01,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:46:01,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 324 transitions, 4083 flow. Second operand has 30 states, 30 states have (on average 10.4) internal successors, (312), 30 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:01,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:01,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:46:01,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:15,436 INFO L124 PetriNetUnfolderBase]: 45150/86043 cut-off events. [2025-03-17 06:46:15,437 INFO L125 PetriNetUnfolderBase]: For 1037544/1037544 co-relation queries the response was YES. [2025-03-17 06:46:16,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339322 conditions, 86043 events. 45150/86043 cut-off events. For 1037544/1037544 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 795735 event pairs, 7229 based on Foata normal form. 707/80989 useless extension candidates. Maximal degree in co-relation 339254. Up to 14385 conditions per place. [2025-03-17 06:46:16,277 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 558 selfloop transitions, 737 changer transitions 367/1669 dead transitions. [2025-03-17 06:46:16,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1669 transitions, 20845 flow [2025-03-17 06:46:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-17 06:46:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-17 06:46:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 1335 transitions. [2025-03-17 06:46:16,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959821428571429 [2025-03-17 06:46:16,280 INFO L175 Difference]: Start difference. First operand has 174 places, 324 transitions, 4083 flow. Second operand 70 states and 1335 transitions. [2025-03-17 06:46:16,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1669 transitions, 20845 flow [2025-03-17 06:46:18,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 1669 transitions, 19455 flow, removed 693 selfloop flow, removed 2 redundant places. [2025-03-17 06:46:18,834 INFO L231 Difference]: Finished difference. Result has 284 places, 889 transitions, 14578 flow [2025-03-17 06:46:18,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3731, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=14578, PETRI_PLACES=284, PETRI_TRANSITIONS=889} [2025-03-17 06:46:18,835 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2025-03-17 06:46:18,835 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 889 transitions, 14578 flow [2025-03-17 06:46:18,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.4) internal successors, (312), 30 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:18,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:18,835 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:18,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 06:46:19,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 06:46:19,036 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:46:19,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1084433003, now seen corresponding path program 6 times [2025-03-17 06:46:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776645934] [2025-03-17 06:46:19,037 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:46:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:19,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-03-17 06:46:19,065 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 06:46:19,065 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 06:46:19,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776645934] [2025-03-17 06:46:19,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776645934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863996777] [2025-03-17 06:46:19,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:46:19,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:19,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:19,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:19,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 06:46:19,937 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-03-17 06:46:19,956 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 06:46:19,956 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 06:46:19,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:19,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 06:46:19,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:46:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:20,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:21,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-03-17 06:46:21,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:46:21,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 530 treesize of output 434 [2025-03-17 06:46:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863996777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:23,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-17 06:46:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087978850] [2025-03-17 06:46:23,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:23,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 06:46:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:23,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 06:46:23,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 06:46:23,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-17 06:46:23,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 889 transitions, 14578 flow. Second operand has 40 states, 40 states have (on average 9.55) internal successors, (382), 40 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:23,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:23,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-17 06:46:23,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand