./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/bench-exp2x9.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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:25:59,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:25:59,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:25:59,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:25:59,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:25:59,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:25:59,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:25:59,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:25:59,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:25:59,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:25:59,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:25:59,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:25:59,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:25:59,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:25:59,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:25:59,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:25:59,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:25:59,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:25:59,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:25:59,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:25:59,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:25:59,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:25:59,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:25:59,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:25:59,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:25:59,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:25:59,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:25:59,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:25:59,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:25:59,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:25:59,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:25:59,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:25:59,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:25:59,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:25:59,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:25:59,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:25:59,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:25:59,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:25:59,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:25:59,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:25:59,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:25:59,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:25:59,858 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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2024-11-10 10:26:00,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:26:00,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:26:00,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:26:00,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:26:00,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:26:00,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2024-11-10 10:26:01,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:26:01,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:26:01,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2024-11-10 10:26:01,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551f6a5cc/7bed73385fd74bfcb9ab3bee39a5280d/FLAGeb6974b1d [2024-11-10 10:26:02,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551f6a5cc/7bed73385fd74bfcb9ab3bee39a5280d [2024-11-10 10:26:02,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:26:02,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:26:02,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:26:02,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:26:02,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:26:02,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f52f6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02, skipping insertion in model container [2024-11-10 10:26:02,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:26:02,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c[2721,2734] [2024-11-10 10:26:02,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:26:02,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:26:02,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c[2721,2734] [2024-11-10 10:26:02,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:26:02,540 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:26:02,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02 WrapperNode [2024-11-10 10:26:02,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:26:02,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:26:02,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:26:02,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:26:02,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,580 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-10 10:26:02,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:26:02,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:26:02,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:26:02,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:26:02,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,622 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-11-10 10:26:02,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:26:02,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:26:02,637 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:26:02,637 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:26:02,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (1/1) ... [2024-11-10 10:26:02,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:26:02,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:26:02,682 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-11-10 10:26:02,687 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-11-10 10:26:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:26:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:26:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:26:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:26:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:26:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 10:26:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 10:26:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 10:26:02,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 10:26:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:26:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:26:02,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:26:02,746 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:26:02,854 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:26:02,856 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:26:03,131 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:26:03,132 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:26:03,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:26:03,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:26:03,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:26:03 BoogieIcfgContainer [2024-11-10 10:26:03,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:26:03,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:26:03,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:26:03,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:26:03,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:26:02" (1/3) ... [2024-11-10 10:26:03,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef42dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:26:03, skipping insertion in model container [2024-11-10 10:26:03,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:26:02" (2/3) ... [2024-11-10 10:26:03,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef42dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:26:03, skipping insertion in model container [2024-11-10 10:26:03,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:26:03" (3/3) ... [2024-11-10 10:26:03,368 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2024-11-10 10:26:03,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:26:03,384 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:26:03,385 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:26:03,456 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-10 10:26:03,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 116 flow [2024-11-10 10:26:03,520 INFO L124 PetriNetUnfolderBase]: 8/40 cut-off events. [2024-11-10 10:26:03,520 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:26:03,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 40 events. 8/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-10 10:26:03,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 116 flow [2024-11-10 10:26:03,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 39 transitions, 102 flow [2024-11-10 10:26:03,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:26:03,548 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74e2ac1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:26:03,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:26:03,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:26:03,562 INFO L124 PetriNetUnfolderBase]: 8/38 cut-off events. [2024-11-10 10:26:03,562 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:26:03,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:03,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:03,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:03,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1312739506, now seen corresponding path program 1 times [2024-11-10 10:26:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85442514] [2024-11-10 10:26:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85442514] [2024-11-10 10:26:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85442514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:26:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112793190] [2024-11-10 10:26:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:03,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:26:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:26:03,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:26:03,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-10 10:26:03,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 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-11-10 10:26:03,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:03,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-10 10:26:03,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:04,129 INFO L124 PetriNetUnfolderBase]: 976/1419 cut-off events. [2024-11-10 10:26:04,129 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-10 10:26:04,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 1419 events. 976/1419 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6539 event pairs, 448 based on Foata normal form. 492/1739 useless extension candidates. Maximal degree in co-relation 2356. Up to 1219 conditions per place. [2024-11-10 10:26:04,151 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 22 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2024-11-10 10:26:04,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 138 flow [2024-11-10 10:26:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:26:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:26:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2024-11-10 10:26:04,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-10 10:26:04,167 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 102 flow. Second operand 2 states and 60 transitions. [2024-11-10 10:26:04,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 138 flow [2024-11-10 10:26:04,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 10:26:04,178 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 78 flow [2024-11-10 10:26:04,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-11-10 10:26:04,187 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2024-11-10 10:26:04,187 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 78 flow [2024-11-10 10:26:04,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 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-11-10 10:26:04,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:04,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:04,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:26:04,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:04,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1087116950, now seen corresponding path program 1 times [2024-11-10 10:26:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255861364] [2024-11-10 10:26:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:04,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255861364] [2024-11-10 10:26:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255861364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:04,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:04,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:26:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651230001] [2024-11-10 10:26:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:26:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:26:04,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:26:04,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-10 10:26:04,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-10 10:26:04,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:04,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-10 10:26:04,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:04,845 INFO L124 PetriNetUnfolderBase]: 1367/2172 cut-off events. [2024-11-10 10:26:04,846 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-10 10:26:04,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3942 conditions, 2172 events. 1367/2172 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11517 event pairs, 123 based on Foata normal form. 1/2112 useless extension candidates. Maximal degree in co-relation 3939. Up to 1541 conditions per place. [2024-11-10 10:26:04,862 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 35 selfloop transitions, 5 changer transitions 1/54 dead transitions. [2024-11-10 10:26:04,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 205 flow [2024-11-10 10:26:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:26:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:26:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-10 10:26:04,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2024-11-10 10:26:04,865 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 78 flow. Second operand 3 states and 93 transitions. [2024-11-10 10:26:04,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 205 flow [2024-11-10 10:26:04,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:26:04,870 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 111 flow [2024-11-10 10:26:04,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-11-10 10:26:04,871 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2024-11-10 10:26:04,871 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 111 flow [2024-11-10 10:26:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-10 10:26:04,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:04,872 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:04,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:26:04,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:04,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1548994165, now seen corresponding path program 1 times [2024-11-10 10:26:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659259755] [2024-11-10 10:26:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659259755] [2024-11-10 10:26:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659259755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:05,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692355494] [2024-11-10 10:26:05,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:05,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:05,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:05,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:05,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:05,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:05,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:05,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:05,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:05,443 INFO L124 PetriNetUnfolderBase]: 2975/4088 cut-off events. [2024-11-10 10:26:05,444 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES. [2024-11-10 10:26:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9521 conditions, 4088 events. 2975/4088 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 20195 event pairs, 205 based on Foata normal form. 68/4106 useless extension candidates. Maximal degree in co-relation 9516. Up to 1437 conditions per place. [2024-11-10 10:26:05,474 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 71 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2024-11-10 10:26:05,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 92 transitions, 423 flow [2024-11-10 10:26:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-11-10 10:26:05,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-10 10:26:05,478 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 111 flow. Second operand 5 states and 150 transitions. [2024-11-10 10:26:05,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 92 transitions, 423 flow [2024-11-10 10:26:05,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 92 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:26:05,481 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 171 flow [2024-11-10 10:26:05,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2024-11-10 10:26:05,482 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-11-10 10:26:05,483 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 171 flow [2024-11-10 10:26:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:05,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:05,483 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:26:05,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2146865453, now seen corresponding path program 2 times [2024-11-10 10:26:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566045744] [2024-11-10 10:26:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566045744] [2024-11-10 10:26:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566045744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469488669] [2024-11-10 10:26:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:05,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:05,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:05,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:05,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:05,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:06,029 INFO L124 PetriNetUnfolderBase]: 2816/4039 cut-off events. [2024-11-10 10:26:06,030 INFO L125 PetriNetUnfolderBase]: For 3571/3571 co-relation queries the response was YES. [2024-11-10 10:26:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 4039 events. 2816/4039 cut-off events. For 3571/3571 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 21219 event pairs, 792 based on Foata normal form. 87/3911 useless extension candidates. Maximal degree in co-relation 10717. Up to 1942 conditions per place. [2024-11-10 10:26:06,100 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 70 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2024-11-10 10:26:06,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 91 transitions, 470 flow [2024-11-10 10:26:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-11-10 10:26:06,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-11-10 10:26:06,102 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 171 flow. Second operand 5 states and 149 transitions. [2024-11-10 10:26:06,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 91 transitions, 470 flow [2024-11-10 10:26:06,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 91 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:26:06,108 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 225 flow [2024-11-10 10:26:06,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2024-11-10 10:26:06,110 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2024-11-10 10:26:06,110 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 225 flow [2024-11-10 10:26:06,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:06,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:06,111 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:06,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:26:06,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1607177105, now seen corresponding path program 1 times [2024-11-10 10:26:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317003381] [2024-11-10 10:26:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317003381] [2024-11-10 10:26:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317003381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:06,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611795911] [2024-11-10 10:26:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:06,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:06,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:06,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:06,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:06,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:06,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:06,631 INFO L124 PetriNetUnfolderBase]: 2808/3822 cut-off events. [2024-11-10 10:26:06,632 INFO L125 PetriNetUnfolderBase]: For 5980/5980 co-relation queries the response was YES. [2024-11-10 10:26:06,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11274 conditions, 3822 events. 2808/3822 cut-off events. For 5980/5980 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 18110 event pairs, 494 based on Foata normal form. 80/3862 useless extension candidates. Maximal degree in co-relation 11264. Up to 1298 conditions per place. [2024-11-10 10:26:06,660 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 73 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-11-10 10:26:06,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 506 flow [2024-11-10 10:26:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-11-10 10:26:06,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-11-10 10:26:06,664 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 225 flow. Second operand 5 states and 148 transitions. [2024-11-10 10:26:06,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 506 flow [2024-11-10 10:26:06,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 497 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-10 10:26:06,676 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 230 flow [2024-11-10 10:26:06,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-11-10 10:26:06,676 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2024-11-10 10:26:06,676 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 230 flow [2024-11-10 10:26:06,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:06,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:06,679 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:06,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:26:06,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:06,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -848891319, now seen corresponding path program 1 times [2024-11-10 10:26:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748311232] [2024-11-10 10:26:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748311232] [2024-11-10 10:26:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748311232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:06,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133432742] [2024-11-10 10:26:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:06,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:06,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:06,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:06,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:06,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:06,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:06,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:06,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:06,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:07,415 INFO L124 PetriNetUnfolderBase]: 4800/6793 cut-off events. [2024-11-10 10:26:07,416 INFO L125 PetriNetUnfolderBase]: For 10548/11103 co-relation queries the response was YES. [2024-11-10 10:26:07,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19044 conditions, 6793 events. 4800/6793 cut-off events. For 10548/11103 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 40661 event pairs, 914 based on Foata normal form. 177/6460 useless extension candidates. Maximal degree in co-relation 19033. Up to 2547 conditions per place. [2024-11-10 10:26:07,465 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 78 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2024-11-10 10:26:07,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 658 flow [2024-11-10 10:26:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-10 10:26:07,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2024-11-10 10:26:07,467 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 230 flow. Second operand 5 states and 145 transitions. [2024-11-10 10:26:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 658 flow [2024-11-10 10:26:07,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 645 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 10:26:07,472 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 276 flow [2024-11-10 10:26:07,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-11-10 10:26:07,473 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2024-11-10 10:26:07,473 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 276 flow [2024-11-10 10:26:07,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:07,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:07,474 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:07,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:26:07,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:07,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2076409027, now seen corresponding path program 2 times [2024-11-10 10:26:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872158709] [2024-11-10 10:26:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872158709] [2024-11-10 10:26:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872158709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:07,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620254355] [2024-11-10 10:26:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:07,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:07,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:07,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:07,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:07,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:08,194 INFO L124 PetriNetUnfolderBase]: 4018/5660 cut-off events. [2024-11-10 10:26:08,194 INFO L125 PetriNetUnfolderBase]: For 11550/11997 co-relation queries the response was YES. [2024-11-10 10:26:08,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18249 conditions, 5660 events. 4018/5660 cut-off events. For 11550/11997 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 31867 event pairs, 244 based on Foata normal form. 121/5434 useless extension candidates. Maximal degree in co-relation 18234. Up to 1938 conditions per place. [2024-11-10 10:26:08,254 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 77 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2024-11-10 10:26:08,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 715 flow [2024-11-10 10:26:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-10 10:26:08,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2024-11-10 10:26:08,256 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 276 flow. Second operand 5 states and 142 transitions. [2024-11-10 10:26:08,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 715 flow [2024-11-10 10:26:08,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 715 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:26:08,271 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 337 flow [2024-11-10 10:26:08,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-11-10 10:26:08,272 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2024-11-10 10:26:08,272 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 337 flow [2024-11-10 10:26:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:08,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:08,272 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:26:08,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:08,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash 381961235, now seen corresponding path program 1 times [2024-11-10 10:26:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:08,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777122861] [2024-11-10 10:26:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:08,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:08,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:08,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777122861] [2024-11-10 10:26:08,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777122861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:08,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:08,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345096632] [2024-11-10 10:26:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:08,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:08,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:08,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:08,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:08,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:08,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:08,871 INFO L124 PetriNetUnfolderBase]: 3932/5459 cut-off events. [2024-11-10 10:26:08,872 INFO L125 PetriNetUnfolderBase]: For 13492/13939 co-relation queries the response was YES. [2024-11-10 10:26:08,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18847 conditions, 5459 events. 3932/5459 cut-off events. For 13492/13939 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 30255 event pairs, 186 based on Foata normal form. 123/5235 useless extension candidates. Maximal degree in co-relation 18830. Up to 1852 conditions per place. [2024-11-10 10:26:08,978 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 77 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2024-11-10 10:26:08,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 724 flow [2024-11-10 10:26:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-10 10:26:08,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-10 10:26:08,981 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 337 flow. Second operand 5 states and 140 transitions. [2024-11-10 10:26:08,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 724 flow [2024-11-10 10:26:08,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 713 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:26:08,996 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 340 flow [2024-11-10 10:26:08,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-11-10 10:26:08,998 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-11-10 10:26:08,999 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 340 flow [2024-11-10 10:26:08,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:09,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:09,002 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:26:09,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:09,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash 824723395, now seen corresponding path program 2 times [2024-11-10 10:26:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612292114] [2024-11-10 10:26:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:09,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612292114] [2024-11-10 10:26:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612292114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:26:09,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:26:09,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:26:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55503765] [2024-11-10 10:26:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:26:09,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:26:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:26:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:26:09,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:09,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:09,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:09,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:09,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:09,680 INFO L124 PetriNetUnfolderBase]: 3806/5451 cut-off events. [2024-11-10 10:26:09,680 INFO L125 PetriNetUnfolderBase]: For 14622/15069 co-relation queries the response was YES. [2024-11-10 10:26:09,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18965 conditions, 5451 events. 3806/5451 cut-off events. For 14622/15069 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 32234 event pairs, 962 based on Foata normal form. 163/5209 useless extension candidates. Maximal degree in co-relation 18947. Up to 2773 conditions per place. [2024-11-10 10:26:09,723 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 76 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2024-11-10 10:26:09,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 744 flow [2024-11-10 10:26:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-10 10:26:09,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-10 10:26:09,726 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 340 flow. Second operand 5 states and 138 transitions. [2024-11-10 10:26:09,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 744 flow [2024-11-10 10:26:09,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 731 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:26:09,738 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 380 flow [2024-11-10 10:26:09,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-11-10 10:26:09,739 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2024-11-10 10:26:09,739 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 380 flow [2024-11-10 10:26:09,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-10 10:26:09,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:09,740 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:09,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:26:09,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash -188401867, now seen corresponding path program 2 times [2024-11-10 10:26:09,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:09,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057490443] [2024-11-10 10:26:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057490443] [2024-11-10 10:26:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057490443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:26:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513817068] [2024-11-10 10:26:09,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:26:09,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:26:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:26:09,822 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-11-10 10:26:09,825 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-11-10 10:26:09,912 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:26:09,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:26:09,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:26:09,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:26:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:10,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:26:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513817068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:26:10,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:26:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-10 10:26:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898165014] [2024-11-10 10:26:10,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:26:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:26:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:26:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:26:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:26:10,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-10 10:26:10,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-11-10 10:26:10,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:26:10,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-10 10:26:10,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:26:10,802 INFO L124 PetriNetUnfolderBase]: 3438/5163 cut-off events. [2024-11-10 10:26:10,802 INFO L125 PetriNetUnfolderBase]: For 14798/14879 co-relation queries the response was YES. [2024-11-10 10:26:10,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19021 conditions, 5163 events. 3438/5163 cut-off events. For 14798/14879 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 30906 event pairs, 1476 based on Foata normal form. 137/4940 useless extension candidates. Maximal degree in co-relation 19000. Up to 2511 conditions per place. [2024-11-10 10:26:10,876 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 92 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2024-11-10 10:26:10,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 117 transitions, 886 flow [2024-11-10 10:26:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:26:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:26:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-11-10 10:26:10,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2024-11-10 10:26:10,878 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 380 flow. Second operand 5 states and 146 transitions. [2024-11-10 10:26:10,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 117 transitions, 886 flow [2024-11-10 10:26:10,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 840 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-11-10 10:26:10,899 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 417 flow [2024-11-10 10:26:10,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2024-11-10 10:26:10,900 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2024-11-10 10:26:10,900 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 417 flow [2024-11-10 10:26:10,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-11-10 10:26:10,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:26:10,901 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:26:10,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:26:11,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 10:26:11,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:26:11,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:26:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1001287814, now seen corresponding path program 1 times [2024-11-10 10:26:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:26:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723067597] [2024-11-10 10:26:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:26:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:26:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:26:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723067597] [2024-11-10 10:26:11,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723067597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:26:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041411859] [2024-11-10 10:26:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:26:11,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:26:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:26:11,732 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-11-10 10:26:11,733 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-11-10 10:26:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:26:11,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 10:26:11,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:27:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:27:23,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:27:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:27:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041411859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:27:33,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:27:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-11-10 10:27:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656972859] [2024-11-10 10:27:33,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:27:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 10:27:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:27:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 10:27:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=168, Unknown=6, NotChecked=0, Total=240 [2024-11-10 10:27:37,945 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 []