./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.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 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:47:40,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:47:40,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:47:40,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:47:40,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:47:40,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:47:40,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:47:40,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:47:40,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:47:40,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:47:40,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:47:40,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:47:40,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:47:40,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:47:40,974 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:47:40,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:47:40,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:47:40,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:47:40,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:47:40,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:47:40,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:47:40,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:47:40,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:47:40,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:47:40,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:47:40,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:47:40,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:47:40,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:47:40,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:47:40,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:47:40,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:47:40,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:47:40,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:47:40,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:47:40,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:47:40,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:47:40,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:47:40,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:47:40,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:47:40,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:47:40,987 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:47:40,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:47:40,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:47:40,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 [2024-06-27 16:47:41,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:47:41,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:47:41,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:47:41,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:47:41,241 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:47:41,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-06-27 16:47:42,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:47:42,515 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:47:42,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-06-27 16:47:42,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3fd305c/b06dd7e510ab4de4b185b71ded53dab8/FLAG19bd8fa98 [2024-06-27 16:47:42,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3fd305c/b06dd7e510ab4de4b185b71ded53dab8 [2024-06-27 16:47:42,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:47:42,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:47:42,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:47:42,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:47:42,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:47:42,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a25b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42, skipping insertion in model container [2024-06-27 16:47:42,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,560 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:47:42,679 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2024-06-27 16:47:42,683 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:47:42,689 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:47:42,702 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2024-06-27 16:47:42,703 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:47:42,715 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:47:42,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42 WrapperNode [2024-06-27 16:47:42,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:47:42,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:47:42,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:47:42,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:47:42,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,738 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2024-06-27 16:47:42,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:47:42,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:47:42,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:47:42,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:47:42,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 16:47:42,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:47:42,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:47:42,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:47:42,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:47:42,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:47:42,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:42,822 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) [2024-06-27 16:47:42,839 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 [2024-06-27 16:47:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:47:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:47:42,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:47:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:47:42,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:47:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:47:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:47:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:47:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:47:42,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:47:42,870 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:47:42,934 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:47:42,936 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:47:43,068 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:47:43,068 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:47:43,151 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:47:43,151 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 16:47:43,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:47:43 BoogieIcfgContainer [2024-06-27 16:47:43,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:47:43,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:47:43,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:47:43,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:47:43,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:47:42" (1/3) ... [2024-06-27 16:47:43,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5609f042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:47:43, skipping insertion in model container [2024-06-27 16:47:43,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (2/3) ... [2024-06-27 16:47:43,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5609f042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:47:43, skipping insertion in model container [2024-06-27 16:47:43,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:47:43" (3/3) ... [2024-06-27 16:47:43,158 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2024-06-27 16:47:43,164 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:47:43,172 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:47:43,172 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:47:43,172 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:47:43,228 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:47:43,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 64 flow [2024-06-27 16:47:43,290 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2024-06-27 16:47:43,290 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:47:43,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-06-27 16:47:43,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 64 flow [2024-06-27 16:47:43,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2024-06-27 16:47:43,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:47:43,309 INFO L357 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, mHoare=true, 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;@708f04ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:47:43,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:47:43,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:47:43,326 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-06-27 16:47:43,326 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:47:43,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:43,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:43,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:47:43,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1256207023, now seen corresponding path program 1 times [2024-06-27 16:47:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297284106] [2024-06-27 16:47:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:43,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297284106] [2024-06-27 16:47:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297284106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941672391] [2024-06-27 16:47:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:47:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:47:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:47:43,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2024-06-27 16:47:43,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:43,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:43,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2024-06-27 16:47:43,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:44,019 INFO L124 PetriNetUnfolderBase]: 104/206 cut-off events. [2024-06-27 16:47:44,020 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-06-27 16:47:44,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 206 events. 104/206 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 783 event pairs, 8 based on Foata normal form. 12/213 useless extension candidates. Maximal degree in co-relation 366. Up to 117 conditions per place. [2024-06-27 16:47:44,026 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 29 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2024-06-27 16:47:44,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 42 transitions, 175 flow [2024-06-27 16:47:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:47:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:47:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-27 16:47:44,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.656 [2024-06-27 16:47:44,038 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 56 flow. Second operand 5 states and 82 transitions. [2024-06-27 16:47:44,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 42 transitions, 175 flow [2024-06-27 16:47:44,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:47:44,043 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2024-06-27 16:47:44,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2024-06-27 16:47:44,051 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2024-06-27 16:47:44,051 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2024-06-27 16:47:44,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:44,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:44,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:44,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:47:44,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:47:44,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -668978712, now seen corresponding path program 1 times [2024-06-27 16:47:44,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:44,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884278108] [2024-06-27 16:47:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:44,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884278108] [2024-06-27 16:47:44,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884278108] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:44,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853611166] [2024-06-27 16:47:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:44,277 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) [2024-06-27 16:47:44,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 16:47:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:44,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 16:47:44,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:44,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:47:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853611166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:47:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 6 [2024-06-27 16:47:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723972749] [2024-06-27 16:47:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:44,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:47:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:47:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:47:44,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-06-27 16:47:44,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-06-27 16:47:44,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:44,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-06-27 16:47:44,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:44,676 INFO L124 PetriNetUnfolderBase]: 151/297 cut-off events. [2024-06-27 16:47:44,676 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-06-27 16:47:44,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 297 events. 151/297 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1153 event pairs, 0 based on Foata normal form. 18/314 useless extension candidates. Maximal degree in co-relation 281. Up to 144 conditions per place. [2024-06-27 16:47:44,679 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 41 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2024-06-27 16:47:44,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 313 flow [2024-06-27 16:47:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 16:47:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 16:47:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-27 16:47:44,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504 [2024-06-27 16:47:44,681 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 10 states and 126 transitions. [2024-06-27 16:47:44,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 313 flow [2024-06-27 16:47:44,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:47:44,684 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 180 flow [2024-06-27 16:47:44,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=180, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-06-27 16:47:44,685 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 17 predicate places. [2024-06-27 16:47:44,685 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 180 flow [2024-06-27 16:47:44,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-06-27 16:47:44,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:44,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:44,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:47:44,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:44,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:47:44,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1597033034, now seen corresponding path program 1 times [2024-06-27 16:47:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318512368] [2024-06-27 16:47:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:45,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318512368] [2024-06-27 16:47:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318512368] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:45,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111932491] [2024-06-27 16:47:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:45,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:45,370 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) [2024-06-27 16:47:45,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 16:47:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:45,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2024-06-27 16:47:45,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:53,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111932491] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:47:54,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 17 [2024-06-27 16:47:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167039430] [2024-06-27 16:47:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:54,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 16:47:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 16:47:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=226, Unknown=2, NotChecked=0, Total=306 [2024-06-27 16:47:54,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 16:47:54,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 180 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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) [2024-06-27 16:47:54,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:54,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 16:47:54,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:54,707 INFO L124 PetriNetUnfolderBase]: 542/923 cut-off events. [2024-06-27 16:47:54,707 INFO L125 PetriNetUnfolderBase]: For 1089/1089 co-relation queries the response was YES. [2024-06-27 16:47:54,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 923 events. 542/923 cut-off events. For 1089/1089 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4035 event pairs, 39 based on Foata normal form. 1/923 useless extension candidates. Maximal degree in co-relation 1794. Up to 230 conditions per place. [2024-06-27 16:47:54,715 INFO L140 encePairwiseOnDemand]: 15/25 looper letters, 88 selfloop transitions, 42 changer transitions 13/146 dead transitions. [2024-06-27 16:47:54,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 146 transitions, 932 flow [2024-06-27 16:47:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 16:47:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 16:47:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 204 transitions. [2024-06-27 16:47:54,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-27 16:47:54,717 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 180 flow. Second operand 16 states and 204 transitions. [2024-06-27 16:47:54,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 146 transitions, 932 flow [2024-06-27 16:47:54,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 146 transitions, 921 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:47:54,724 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 531 flow [2024-06-27 16:47:54,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=531, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-27 16:47:54,725 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 41 predicate places. [2024-06-27 16:47:54,725 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 531 flow [2024-06-27 16:47:54,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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) [2024-06-27 16:47:54,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:54,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:54,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 16:47:54,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-27 16:47:54,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:47:54,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 425281426, now seen corresponding path program 2 times [2024-06-27 16:47:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604611245] [2024-06-27 16:47:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604611245] [2024-06-27 16:47:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604611245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014587819] [2024-06-27 16:47:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:47:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:47:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:47:55,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2024-06-27 16:47:55,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 531 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) [2024-06-27 16:47:55,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:55,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2024-06-27 16:47:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:55,158 INFO L124 PetriNetUnfolderBase]: 357/700 cut-off events. [2024-06-27 16:47:55,159 INFO L125 PetriNetUnfolderBase]: For 3604/3690 co-relation queries the response was YES. [2024-06-27 16:47:55,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 700 events. 357/700 cut-off events. For 3604/3690 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3373 event pairs, 12 based on Foata normal form. 16/710 useless extension candidates. Maximal degree in co-relation 3008. Up to 326 conditions per place. [2024-06-27 16:47:55,165 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 71 selfloop transitions, 15 changer transitions 0/102 dead transitions. [2024-06-27 16:47:55,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 950 flow [2024-06-27 16:47:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:47:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:47:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-06-27 16:47:55,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.624 [2024-06-27 16:47:55,166 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 531 flow. Second operand 5 states and 78 transitions. [2024-06-27 16:47:55,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 950 flow [2024-06-27 16:47:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 814 flow, removed 60 selfloop flow, removed 5 redundant places. [2024-06-27 16:47:55,179 INFO L231 Difference]: Finished difference. Result has 67 places, 74 transitions, 531 flow [2024-06-27 16:47:55,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=67, PETRI_TRANSITIONS=74} [2024-06-27 16:47:55,179 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 40 predicate places. [2024-06-27 16:47:55,179 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 74 transitions, 531 flow [2024-06-27 16:47:55,180 INFO L496 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) [2024-06-27 16:47:55,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:55,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:55,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:47:55,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:47:55,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -875479503, now seen corresponding path program 1 times [2024-06-27 16:47:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688210496] [2024-06-27 16:47:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:55,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688210496] [2024-06-27 16:47:55,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688210496] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:55,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038904713] [2024-06-27 16:47:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:55,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:55,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:55,795 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) [2024-06-27 16:47:55,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 16:47:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:55,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-27 16:47:55,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:56,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038904713] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:47:57,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:47:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-06-27 16:47:57,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577475217] [2024-06-27 16:47:57,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:47:57,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-06-27 16:47:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-06-27 16:47:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2024-06-27 16:47:57,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 16:47:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 74 transitions, 531 flow. Second operand has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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) [2024-06-27 16:47:57,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:57,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 16:47:57,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:08,379 INFO L124 PetriNetUnfolderBase]: 1864/3256 cut-off events. [2024-06-27 16:48:08,379 INFO L125 PetriNetUnfolderBase]: For 12740/12740 co-relation queries the response was YES. [2024-06-27 16:48:08,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13407 conditions, 3256 events. 1864/3256 cut-off events. For 12740/12740 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18810 event pairs, 28 based on Foata normal form. 20/3275 useless extension candidates. Maximal degree in co-relation 9902. Up to 729 conditions per place. [2024-06-27 16:48:08,414 INFO L140 encePairwiseOnDemand]: 12/25 looper letters, 283 selfloop transitions, 225 changer transitions 156/667 dead transitions. [2024-06-27 16:48:08,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 667 transitions, 5576 flow [2024-06-27 16:48:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-06-27 16:48:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2024-06-27 16:48:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 933 transitions. [2024-06-27 16:48:08,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41010989010989013 [2024-06-27 16:48:08,421 INFO L175 Difference]: Start difference. First operand has 67 places, 74 transitions, 531 flow. Second operand 91 states and 933 transitions. [2024-06-27 16:48:08,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 667 transitions, 5576 flow [2024-06-27 16:48:08,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 667 transitions, 5520 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 16:48:08,457 INFO L231 Difference]: Finished difference. Result has 210 places, 287 transitions, 3010 flow [2024-06-27 16:48:08,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=3010, PETRI_PLACES=210, PETRI_TRANSITIONS=287} [2024-06-27 16:48:08,459 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 183 predicate places. [2024-06-27 16:48:08,459 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 287 transitions, 3010 flow [2024-06-27 16:48:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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) [2024-06-27 16:48:08,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:08,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:08,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-27 16:48:08,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:08,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:48:08,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 569790227, now seen corresponding path program 2 times [2024-06-27 16:48:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034969178] [2024-06-27 16:48:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034969178] [2024-06-27 16:48:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034969178] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788680723] [2024-06-27 16:48:09,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:48:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:09,327 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) [2024-06-27 16:48:09,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 16:48:09,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:48:09,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:48:09,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-27 16:48:09,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:09,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788680723] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:48:10,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:48:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2024-06-27 16:48:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793250307] [2024-06-27 16:48:10,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:48:10,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 16:48:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 16:48:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-06-27 16:48:10,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 16:48:10,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 287 transitions, 3010 flow. Second operand has 21 states, 21 states have (on average 7.476190476190476) internal successors, (157), 21 states have internal predecessors, (157), 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) [2024-06-27 16:48:10,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:10,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 16:48:10,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:15,568 INFO L124 PetriNetUnfolderBase]: 2699/4708 cut-off events. [2024-06-27 16:48:15,568 INFO L125 PetriNetUnfolderBase]: For 75043/75043 co-relation queries the response was YES. [2024-06-27 16:48:15,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31977 conditions, 4708 events. 2699/4708 cut-off events. For 75043/75043 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 29398 event pairs, 87 based on Foata normal form. 15/4722 useless extension candidates. Maximal degree in co-relation 31776. Up to 1468 conditions per place. [2024-06-27 16:48:15,701 INFO L140 encePairwiseOnDemand]: 14/25 looper letters, 363 selfloop transitions, 313 changer transitions 107/786 dead transitions. [2024-06-27 16:48:15,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 786 transitions, 10446 flow [2024-06-27 16:48:15,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-06-27 16:48:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2024-06-27 16:48:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 672 transitions. [2024-06-27 16:48:15,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4335483870967742 [2024-06-27 16:48:15,711 INFO L175 Difference]: Start difference. First operand has 210 places, 287 transitions, 3010 flow. Second operand 62 states and 672 transitions. [2024-06-27 16:48:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 786 transitions, 10446 flow [2024-06-27 16:48:15,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 786 transitions, 9044 flow, removed 693 selfloop flow, removed 28 redundant places. [2024-06-27 16:48:15,910 INFO L231 Difference]: Finished difference. Result has 261 places, 496 transitions, 6248 flow [2024-06-27 16:48:15,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2698, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=6248, PETRI_PLACES=261, PETRI_TRANSITIONS=496} [2024-06-27 16:48:15,911 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 234 predicate places. [2024-06-27 16:48:15,911 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 496 transitions, 6248 flow [2024-06-27 16:48:15,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.476190476190476) internal successors, (157), 21 states have internal predecessors, (157), 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) [2024-06-27 16:48:15,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:15,912 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:15,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-27 16:48:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:16,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:48:16,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 588700951, now seen corresponding path program 3 times [2024-06-27 16:48:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661477215] [2024-06-27 16:48:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:16,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661477215] [2024-06-27 16:48:16,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661477215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:16,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:16,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:48:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201981647] [2024-06-27 16:48:16,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:16,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:48:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:16,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:48:16,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:48:16,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2024-06-27 16:48:16,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 496 transitions, 6248 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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) [2024-06-27 16:48:16,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:16,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2024-06-27 16:48:16,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:17,167 INFO L124 PetriNetUnfolderBase]: 2677/4775 cut-off events. [2024-06-27 16:48:17,167 INFO L125 PetriNetUnfolderBase]: For 78176/78754 co-relation queries the response was YES. [2024-06-27 16:48:17,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30962 conditions, 4775 events. 2677/4775 cut-off events. For 78176/78754 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31118 event pairs, 13 based on Foata normal form. 124/4882 useless extension candidates. Maximal degree in co-relation 30840. Up to 1146 conditions per place. [2024-06-27 16:48:17,217 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 602 selfloop transitions, 234 changer transitions 0/888 dead transitions. [2024-06-27 16:48:17,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 888 transitions, 12929 flow [2024-06-27 16:48:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:48:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:48:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-27 16:48:17,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-06-27 16:48:17,221 INFO L175 Difference]: Start difference. First operand has 261 places, 496 transitions, 6248 flow. Second operand 9 states and 111 transitions. [2024-06-27 16:48:17,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 888 transitions, 12929 flow [2024-06-27 16:48:17,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 888 transitions, 12109 flow, removed 372 selfloop flow, removed 22 redundant places. [2024-06-27 16:48:17,599 INFO L231 Difference]: Finished difference. Result has 237 places, 603 transitions, 8008 flow [2024-06-27 16:48:17,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=5634, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8008, PETRI_PLACES=237, PETRI_TRANSITIONS=603} [2024-06-27 16:48:17,600 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 210 predicate places. [2024-06-27 16:48:17,601 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 603 transitions, 8008 flow [2024-06-27 16:48:17,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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) [2024-06-27 16:48:17,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:17,601 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:17,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:48:17,601 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:48:17,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash -350404842, now seen corresponding path program 3 times [2024-06-27 16:48:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:17,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415665022] [2024-06-27 16:48:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:18,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:18,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415665022] [2024-06-27 16:48:18,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415665022] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:18,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129337607] [2024-06-27 16:48:18,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:48:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:18,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:18,055 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) [2024-06-27 16:48:18,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 16:48:18,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:48:18,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:48:18,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 16:48:18,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:18,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:39,355 WARN L293 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 31 DAG size of output: 15 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-06-27 16:48:51,594 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 75 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:48:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129337607] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:48:52,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:48:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2024-06-27 16:48:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753192109] [2024-06-27 16:48:52,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:48:52,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 16:48:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 16:48:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2024-06-27 16:48:52,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2024-06-27 16:48:52,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 603 transitions, 8008 flow. Second operand has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 28 states have internal predecessors, (277), 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) [2024-06-27 16:48:52,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:52,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2024-06-27 16:48:52,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:49:19,747 WARN L293 SmtUtils]: Spent 24.14s on a formula simplification. DAG size of input: 100 DAG size of output: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:49:35,268 WARN L293 SmtUtils]: Spent 15.22s on a formula simplification. DAG size of input: 107 DAG size of output: 100 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:49:40,452 INFO L124 PetriNetUnfolderBase]: 3508/6828 cut-off events. [2024-06-27 16:49:40,452 INFO L125 PetriNetUnfolderBase]: For 119439/120185 co-relation queries the response was YES. [2024-06-27 16:49:40,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49092 conditions, 6828 events. 3508/6828 cut-off events. For 119439/120185 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 52355 event pairs, 22 based on Foata normal form. 446/7256 useless extension candidates. Maximal degree in co-relation 48673. Up to 2275 conditions per place. [2024-06-27 16:49:40,525 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 619 selfloop transitions, 474 changer transitions 81/1211 dead transitions. [2024-06-27 16:49:40,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1211 transitions, 18229 flow [2024-06-27 16:49:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-06-27 16:49:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-06-27 16:49:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 800 transitions. [2024-06-27 16:49:40,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245901639344263 [2024-06-27 16:49:40,528 INFO L175 Difference]: Start difference. First operand has 237 places, 603 transitions, 8008 flow. Second operand 61 states and 800 transitions. [2024-06-27 16:49:40,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1211 transitions, 18229 flow [2024-06-27 16:49:41,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 1211 transitions, 18183 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 16:49:41,282 INFO L231 Difference]: Finished difference. Result has 327 places, 905 transitions, 14355 flow [2024-06-27 16:49:41,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=7972, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=14355, PETRI_PLACES=327, PETRI_TRANSITIONS=905} [2024-06-27 16:49:41,284 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 300 predicate places. [2024-06-27 16:49:41,284 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 905 transitions, 14355 flow [2024-06-27 16:49:41,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 28 states have internal predecessors, (277), 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) [2024-06-27 16:49:41,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:49:41,284 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:49:41,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-27 16:49:41,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:49:41,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:49:41,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:49:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash -255374872, now seen corresponding path program 4 times [2024-06-27 16:49:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:49:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871547624] [2024-06-27 16:49:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:49:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:49:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:49:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:49:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:49:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871547624] [2024-06-27 16:49:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871547624] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:49:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279641264] [2024-06-27 16:49:42,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:49:42,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:49:42,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:49:42,038 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) [2024-06-27 16:49:42,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-27 16:49:42,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:49:42,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:49:42,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 16:49:42,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:49:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:49:42,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:49:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:49:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279641264] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:49:44,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:49:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 16:49:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032445488] [2024-06-27 16:49:44,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:49:44,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 16:49:44,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:49:44,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 16:49:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-06-27 16:49:44,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 16:49:44,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 905 transitions, 14355 flow. Second operand has 32 states, 32 states have (on average 6.96875) internal successors, (223), 32 states have internal predecessors, (223), 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) [2024-06-27 16:49:44,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:49:44,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 16:49:44,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:49:54,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:50:26,197 WARN L293 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 70 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:50:32,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:50:45,195 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 95 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:50:49,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:50:58,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:51:03,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:51:07,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:51:54,226 INFO L124 PetriNetUnfolderBase]: 6521/11222 cut-off events. [2024-06-27 16:51:54,226 INFO L125 PetriNetUnfolderBase]: For 245331/245331 co-relation queries the response was YES. [2024-06-27 16:51:54,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89329 conditions, 11222 events. 6521/11222 cut-off events. For 245331/245331 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79116 event pairs, 70 based on Foata normal form. 22/11243 useless extension candidates. Maximal degree in co-relation 89080. Up to 2986 conditions per place. [2024-06-27 16:51:54,439 INFO L140 encePairwiseOnDemand]: 13/25 looper letters, 745 selfloop transitions, 782 changer transitions 200/1730 dead transitions. [2024-06-27 16:51:54,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1730 transitions, 30204 flow [2024-06-27 16:51:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-06-27 16:51:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2024-06-27 16:51:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 1055 transitions. [2024-06-27 16:51:54,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40576923076923077 [2024-06-27 16:51:54,452 INFO L175 Difference]: Start difference. First operand has 327 places, 905 transitions, 14355 flow. Second operand 104 states and 1055 transitions. [2024-06-27 16:51:54,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1730 transitions, 30204 flow [2024-06-27 16:51:56,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1730 transitions, 28419 flow, removed 856 selfloop flow, removed 13 redundant places. [2024-06-27 16:51:56,593 INFO L231 Difference]: Finished difference. Result has 459 places, 1230 transitions, 21501 flow [2024-06-27 16:51:56,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=13278, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=21501, PETRI_PLACES=459, PETRI_TRANSITIONS=1230} [2024-06-27 16:51:56,594 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 432 predicate places. [2024-06-27 16:51:56,594 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 1230 transitions, 21501 flow [2024-06-27 16:51:56,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.96875) internal successors, (223), 32 states have internal predecessors, (223), 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) [2024-06-27 16:51:56,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:51:56,595 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:51:56,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-06-27 16:51:56,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:56,806 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:51:56,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:51:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1838307012, now seen corresponding path program 5 times [2024-06-27 16:51:56,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:51:56,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162996525] [2024-06-27 16:51:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:51:56,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:51:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:52:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:52:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:52:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162996525] [2024-06-27 16:52:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162996525] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:52:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778546416] [2024-06-27 16:52:01,941 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:52:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:52:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:52:01,950 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) [2024-06-27 16:52:01,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-27 16:52:02,037 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 16:52:02,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:52:02,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 29 conjunts are in the unsatisfiable core [2024-06-27 16:52:02,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:52:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:52:36,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:53:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:53:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778546416] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:53:16,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:53:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 34 [2024-06-27 16:53:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670834151] [2024-06-27 16:53:16,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:53:16,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-06-27 16:53:16,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:53:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-06-27 16:53:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=971, Unknown=13, NotChecked=0, Total=1190 [2024-06-27 16:53:20,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:53:24,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:53:28,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:53:32,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:53:32,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 16:53:32,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1230 transitions, 21501 flow. Second operand has 35 states, 35 states have (on average 6.685714285714286) internal successors, (234), 35 states have internal predecessors, (234), 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) [2024-06-27 16:53:32,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:53:32,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 16:53:32,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:53:50,385 WARN L293 SmtUtils]: Spent 16.08s on a formula simplification. DAG size of input: 72 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:54:23,118 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 71 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:54:36,322 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 100 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:54:45,707 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 100 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:54:54,818 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 100 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:55:03,104 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 107 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:55:17,530 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 58 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:55:30,988 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 57 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:55:32,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:55:51,573 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 58 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:55:55,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:56:04,625 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 66 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:56:17,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:56:21,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:56:31,839 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 66 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:56:43,411 WARN L293 SmtUtils]: Spent 10.60s on a formula simplification. DAG size of input: 132 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:57:02,186 WARN L293 SmtUtils]: Spent 17.34s on a formula simplification. DAG size of input: 144 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:57:09,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:57:20,577 INFO L124 PetriNetUnfolderBase]: 9822/16689 cut-off events. [2024-06-27 16:57:20,577 INFO L125 PetriNetUnfolderBase]: For 362836/362836 co-relation queries the response was YES. [2024-06-27 16:57:20,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142236 conditions, 16689 events. 9822/16689 cut-off events. For 362836/362836 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 121851 event pairs, 117 based on Foata normal form. 18/16706 useless extension candidates. Maximal degree in co-relation 141715. Up to 3655 conditions per place. [2024-06-27 16:57:20,907 INFO L140 encePairwiseOnDemand]: 12/25 looper letters, 773 selfloop transitions, 1864 changer transitions 100/2740 dead transitions. [2024-06-27 16:57:20,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 2740 transitions, 53695 flow [2024-06-27 16:57:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-06-27 16:57:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2024-06-27 16:57:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 1113 transitions. [2024-06-27 16:57:20,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4122222222222222 [2024-06-27 16:57:20,940 INFO L175 Difference]: Start difference. First operand has 459 places, 1230 transitions, 21501 flow. Second operand 108 states and 1113 transitions. [2024-06-27 16:57:20,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 2740 transitions, 53695 flow [2024-06-27 16:57:26,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 2740 transitions, 51138 flow, removed 1218 selfloop flow, removed 44 redundant places. [2024-06-27 16:57:26,186 INFO L231 Difference]: Finished difference. Result has 538 places, 2276 transitions, 46183 flow [2024-06-27 16:57:26,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=20505, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=943, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=46183, PETRI_PLACES=538, PETRI_TRANSITIONS=2276} [2024-06-27 16:57:26,188 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 511 predicate places. [2024-06-27 16:57:26,189 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 2276 transitions, 46183 flow [2024-06-27 16:57:26,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.685714285714286) internal successors, (234), 35 states have internal predecessors, (234), 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) [2024-06-27 16:57:26,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:57:26,189 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:57:26,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-06-27 16:57:26,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:57:26,396 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:57:26,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:57:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1877740012, now seen corresponding path program 6 times [2024-06-27 16:57:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:57:26,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878249896] [2024-06-27 16:57:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:57:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:57:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:57:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:57:35,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:57:35,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878249896] [2024-06-27 16:57:35,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878249896] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:57:35,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835301496] [2024-06-27 16:57:35,205 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:57:35,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:57:35,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:57:35,206 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) [2024-06-27 16:57:35,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-27 16:57:35,288 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 16:57:35,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:57:35,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 16:57:35,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:57:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:57:43,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:57:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:57:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835301496] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:57:45,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:57:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2024-06-27 16:57:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873028254] [2024-06-27 16:57:45,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:57:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-06-27 16:57:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:57:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-06-27 16:57:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=578, Unknown=4, NotChecked=0, Total=702 [2024-06-27 16:57:49,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:57:53,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:57:54,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:57:54,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 16:57:54,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 2276 transitions, 46183 flow. Second operand has 27 states, 27 states have (on average 7.111111111111111) internal successors, (192), 27 states have internal predecessors, (192), 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) [2024-06-27 16:57:54,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:57:54,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 16:57:54,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:57:59,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:03,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:11,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:15,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:23,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:27,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:31,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:43,962 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 85 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:58:48,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:52,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:58:56,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:59:08,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:59:16,702 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 85 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:59:21,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:59:25,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:59:29,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:59:46,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:59:50,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 17:00:03,765 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 58 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:00:24,450 INFO L124 PetriNetUnfolderBase]: 14077/23970 cut-off events. [2024-06-27 17:00:24,450 INFO L125 PetriNetUnfolderBase]: For 703636/703636 co-relation queries the response was YES. [2024-06-27 17:00:25,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237507 conditions, 23970 events. 14077/23970 cut-off events. For 703636/703636 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 183023 event pairs, 119 based on Foata normal form. 33/24002 useless extension candidates. Maximal degree in co-relation 237193. Up to 6342 conditions per place. [2024-06-27 17:00:25,307 INFO L140 encePairwiseOnDemand]: 14/25 looper letters, 1949 selfloop transitions, 1828 changer transitions 187/3967 dead transitions. [2024-06-27 17:00:25,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 3967 transitions, 88711 flow [2024-06-27 17:00:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-06-27 17:00:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2024-06-27 17:00:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 927 transitions. [2024-06-27 17:00:25,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521951219512195 [2024-06-27 17:00:25,318 INFO L175 Difference]: Start difference. First operand has 538 places, 2276 transitions, 46183 flow. Second operand 82 states and 927 transitions. [2024-06-27 17:00:25,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 3967 transitions, 88711 flow [2024-06-27 17:00:39,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 3967 transitions, 82012 flow, removed 3290 selfloop flow, removed 23 redundant places. [2024-06-27 17:00:39,716 INFO L231 Difference]: Finished difference. Result has 627 places, 3082 transitions, 67307 flow [2024-06-27 17:00:39,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=43562, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=67307, PETRI_PLACES=627, PETRI_TRANSITIONS=3082} [2024-06-27 17:00:39,719 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 600 predicate places. [2024-06-27 17:00:39,719 INFO L495 AbstractCegarLoop]: Abstraction has has 627 places, 3082 transitions, 67307 flow [2024-06-27 17:00:39,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.111111111111111) internal successors, (192), 27 states have internal predecessors, (192), 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) [2024-06-27 17:00:39,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:39,719 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:39,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-06-27 17:00:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 17:00:39,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:00:39,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1194088709, now seen corresponding path program 7 times [2024-06-27 17:00:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:39,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290332073] [2024-06-27 17:00:39,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290332073] [2024-06-27 17:00:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290332073] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891897546] [2024-06-27 17:00:41,330 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:00:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:41,332 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) [2024-06-27 17:00:41,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-27 17:00:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:41,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-27 17:00:41,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:42,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891897546] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:46,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:46,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2024-06-27 17:00:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339074102] [2024-06-27 17:00:46,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:46,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:00:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:00:46,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:00:46,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2024-06-27 17:00:46,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 3082 transitions, 67307 flow. Second operand has 28 states, 28 states have (on average 7.357142857142857) internal successors, (206), 28 states have internal predecessors, (206), 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) [2024-06-27 17:00:46,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:46,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2024-06-27 17:00:46,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:52,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 17:01:38,868 WARN L293 SmtUtils]: Spent 9.69s on a formula simplification. DAG size of input: 119 DAG size of output: 96 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15