./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.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 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:43:50,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:43:50,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:43:50,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:43:50,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:43:50,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:43:50,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:43:50,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:43:50,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:43:50,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:43:50,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:43:50,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:43:50,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:43:50,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:43:50,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:43:50,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:43:50,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:43:50,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:43:50,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:43:50,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:43:50,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:43:50,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:43:50,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:43:50,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:43:50,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:43:50,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:43:50,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:43:50,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:43:50,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:43:50,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:43:50,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:43:50,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:43:50,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:43:50,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:43:50,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:43:50,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:43:50,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:43:50,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:43:50,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:43:50,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:43:50,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:43:50,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:43:50,878 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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-11-20 09:43:51,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:43:51,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:43:51,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:43:51,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:43:51,190 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:43:51,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-20 09:43:52,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:43:52,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:43:52,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-20 09:43:52,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc72bb97/453c51a05a8042d396b9670267d4b5d3/FLAGd8d625ae6 [2024-11-20 09:43:52,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc72bb97/453c51a05a8042d396b9670267d4b5d3 [2024-11-20 09:43:52,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:43:52,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:43:52,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:43:52,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:43:52,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:43:52,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:43:52" (1/1) ... [2024-11-20 09:43:52,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ad3b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:52, skipping insertion in model container [2024-11-20 09:43:52,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:43:52" (1/1) ... [2024-11-20 09:43:52,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:43:53,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-11-20 09:43:53,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:43:53,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:43:53,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-11-20 09:43:53,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:43:53,270 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:43:53,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53 WrapperNode [2024-11-20 09:43:53,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:43:53,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:43:53,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:43:53,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:43:53,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,302 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-20 09:43:53,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:43:53,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:43:53,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:43:53,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:43:53,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,335 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-20 09:43:53,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:43:53,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:43:53,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:43:53,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:43:53,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (1/1) ... [2024-11-20 09:43:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:43:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:43:53,398 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-20 09:43:53,401 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-20 09:43:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:43:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 09:43:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 09:43:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 09:43:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 09:43:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-20 09:43:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-20 09:43:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:43:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:43:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:43:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:43:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:43:53,458 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:43:53,565 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:43:53,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:43:53,779 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:43:53,779 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:43:53,930 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:43:53,930 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 09:43:53,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:43:53 BoogieIcfgContainer [2024-11-20 09:43:53,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:43:53,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:43:53,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:43:53,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:43:53,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:43:52" (1/3) ... [2024-11-20 09:43:53,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b01186e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:43:53, skipping insertion in model container [2024-11-20 09:43:53,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:53" (2/3) ... [2024-11-20 09:43:53,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b01186e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:43:53, skipping insertion in model container [2024-11-20 09:43:53,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:43:53" (3/3) ... [2024-11-20 09:43:53,940 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-11-20 09:43:53,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:43:53,956 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:43:53,956 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:43:54,029 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-20 09:43:54,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2024-11-20 09:43:54,100 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-11-20 09:43:54,100 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-20 09:43:54,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-20 09:43:54,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2024-11-20 09:43:54,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2024-11-20 09:43:54,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:43:54,146 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;@1f28c8b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:43:54,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 09:43:54,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:43:54,159 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-11-20 09:43:54,160 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-20 09:43:54,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:54,161 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] [2024-11-20 09:43:54,162 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 1 more)] === [2024-11-20 09:43:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1857037086, now seen corresponding path program 1 times [2024-11-20 09:43:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:54,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139769206] [2024-11-20 09:43:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:54,782 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-20 09:43:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139769206] [2024-11-20 09:43:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139769206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:54,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:43:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882436419] [2024-11-20 09:43:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:54,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:43:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:43:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:43:54,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-20 09:43:54,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-20 09:43:54,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:54,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-20 09:43:54,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:55,024 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-11-20 09:43:55,024 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-20 09:43:55,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2475 event pairs, 34 based on Foata normal form. 1/536 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-11-20 09:43:55,033 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-20 09:43:55,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-11-20 09:43:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:43:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:43:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-20 09:43:55,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-20 09:43:55,047 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-11-20 09:43:55,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-11-20 09:43:55,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-20 09:43:55,053 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-11-20 09:43:55,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-11-20 09:43:55,060 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-11-20 09:43:55,060 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-11-20 09:43:55,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-20 09:43:55,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:55,061 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] [2024-11-20 09:43:55,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:43:55,061 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 1 more)] === [2024-11-20 09:43:55,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash 345968512, now seen corresponding path program 1 times [2024-11-20 09:43:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805958024] [2024-11-20 09:43:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805958024] [2024-11-20 09:43:55,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805958024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:55,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:55,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:43:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050867698] [2024-11-20 09:43:55,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:55,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:43:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:43:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:43:55,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:43:55,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-20 09:43:55,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:55,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:43:55,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:55,639 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-11-20 09:43:55,640 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-11-20 09:43:55,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4362 event pairs, 20 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-11-20 09:43:55,651 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-11-20 09:43:55,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-11-20 09:43:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:43:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:43:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-11-20 09:43:55,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2024-11-20 09:43:55,656 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 150 transitions. [2024-11-20 09:43:55,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-11-20 09:43:55,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 09:43:55,660 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-11-20 09:43:55,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-11-20 09:43:55,663 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-11-20 09:43:55,663 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-11-20 09:43:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-20 09:43:55,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:55,664 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] [2024-11-20 09:43:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:43:55,665 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 1 more)] === [2024-11-20 09:43:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 160537772, now seen corresponding path program 2 times [2024-11-20 09:43:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281561967] [2024-11-20 09:43:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281561967] [2024-11-20 09:43:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281561967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:55,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:43:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477161024] [2024-11-20 09:43:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:55,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:43:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:43:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:43:55,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:43:55,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-20 09:43:55,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:55,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:43:55,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:56,153 INFO L124 PetriNetUnfolderBase]: 698/1103 cut-off events. [2024-11-20 09:43:56,154 INFO L125 PetriNetUnfolderBase]: For 734/804 co-relation queries the response was YES. [2024-11-20 09:43:56,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1103 events. 698/1103 cut-off events. For 734/804 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5450 event pairs, 78 based on Foata normal form. 31/1088 useless extension candidates. Maximal degree in co-relation 2785. Up to 713 conditions per place. [2024-11-20 09:43:56,185 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-11-20 09:43:56,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-11-20 09:43:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:43:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:43:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-11-20 09:43:56,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-11-20 09:43:56,188 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 144 transitions. [2024-11-20 09:43:56,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-11-20 09:43:56,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 09:43:56,194 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-11-20 09:43:56,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2024-11-20 09:43:56,195 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2024-11-20 09:43:56,195 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-11-20 09:43:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-20 09:43:56,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:56,196 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] [2024-11-20 09:43:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:43:56,196 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 1 more)] === [2024-11-20 09:43:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1462173970, now seen corresponding path program 3 times [2024-11-20 09:43:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616094815] [2024-11-20 09:43:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616094815] [2024-11-20 09:43:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616094815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:43:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320317639] [2024-11-20 09:43:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:43:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:43:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:43:56,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-20 09:43:56,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-20 09:43:56,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:56,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-20 09:43:56,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:56,877 INFO L124 PetriNetUnfolderBase]: 1472/2215 cut-off events. [2024-11-20 09:43:56,878 INFO L125 PetriNetUnfolderBase]: For 2673/2751 co-relation queries the response was YES. [2024-11-20 09:43:56,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 2215 events. 1472/2215 cut-off events. For 2673/2751 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 11761 event pairs, 120 based on Foata normal form. 37/2204 useless extension candidates. Maximal degree in co-relation 5295. Up to 915 conditions per place. [2024-11-20 09:43:56,898 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 38 changer transitions 2/135 dead transitions. [2024-11-20 09:43:56,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 135 transitions, 922 flow [2024-11-20 09:43:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:43:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 09:43:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-11-20 09:43:56,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-20 09:43:56,904 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 9 states and 198 transitions. [2024-11-20 09:43:56,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 135 transitions, 922 flow [2024-11-20 09:43:56,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 878 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-20 09:43:56,920 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 584 flow [2024-11-20 09:43:56,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2024-11-20 09:43:56,923 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-11-20 09:43:56,923 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 584 flow [2024-11-20 09:43:56,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-20 09:43:56,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:56,925 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] [2024-11-20 09:43:56,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:43:56,926 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 1 more)] === [2024-11-20 09:43:56,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1153795878, now seen corresponding path program 4 times [2024-11-20 09:43:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:56,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783015067] [2024-11-20 09:43:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:57,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783015067] [2024-11-20 09:43:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783015067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:57,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:57,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:43:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342766563] [2024-11-20 09:43:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:43:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:43:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:43:57,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:43:57,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-20 09:43:57,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:57,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:43:57,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:57,456 INFO L124 PetriNetUnfolderBase]: 1361/2148 cut-off events. [2024-11-20 09:43:57,457 INFO L125 PetriNetUnfolderBase]: For 6235/6379 co-relation queries the response was YES. [2024-11-20 09:43:57,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2148 events. 1361/2148 cut-off events. For 6235/6379 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 12175 event pairs, 141 based on Foata normal form. 38/2128 useless extension candidates. Maximal degree in co-relation 6477. Up to 1240 conditions per place. [2024-11-20 09:43:57,480 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 65 selfloop transitions, 34 changer transitions 2/110 dead transitions. [2024-11-20 09:43:57,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 993 flow [2024-11-20 09:43:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:43:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:43:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-20 09:43:57,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-20 09:43:57,482 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 584 flow. Second operand 6 states and 126 transitions. [2024-11-20 09:43:57,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 993 flow [2024-11-20 09:43:57,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-20 09:43:57,504 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 742 flow [2024-11-20 09:43:57,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-11-20 09:43:57,505 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2024-11-20 09:43:57,506 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 742 flow [2024-11-20 09:43:57,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-20 09:43:57,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:57,506 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] [2024-11-20 09:43:57,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:43:57,506 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 1 more)] === [2024-11-20 09:43:57,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash 973411842, now seen corresponding path program 1 times [2024-11-20 09:43:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505799590] [2024-11-20 09:43:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:57,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:57,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505799590] [2024-11-20 09:43:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505799590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:57,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:57,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:43:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752356859] [2024-11-20 09:43:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:57,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:43:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:43:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:43:57,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-20 09:43:57,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-20 09:43:57,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:57,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-20 09:43:57,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:58,094 INFO L124 PetriNetUnfolderBase]: 1771/2729 cut-off events. [2024-11-20 09:43:58,094 INFO L125 PetriNetUnfolderBase]: For 11436/11618 co-relation queries the response was YES. [2024-11-20 09:43:58,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11686 conditions, 2729 events. 1771/2729 cut-off events. For 11436/11618 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 15486 event pairs, 196 based on Foata normal form. 49/2728 useless extension candidates. Maximal degree in co-relation 9056. Up to 1448 conditions per place. [2024-11-20 09:43:58,154 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 99 selfloop transitions, 29 changer transitions 2/137 dead transitions. [2024-11-20 09:43:58,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 1371 flow [2024-11-20 09:43:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:43:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:43:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-11-20 09:43:58,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-20 09:43:58,155 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 742 flow. Second operand 7 states and 147 transitions. [2024-11-20 09:43:58,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 1371 flow [2024-11-20 09:43:58,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1314 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-20 09:43:58,182 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 834 flow [2024-11-20 09:43:58,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=834, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-11-20 09:43:58,183 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2024-11-20 09:43:58,183 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 834 flow [2024-11-20 09:43:58,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-20 09:43:58,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:58,184 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] [2024-11-20 09:43:58,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:43:58,185 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 1 more)] === [2024-11-20 09:43:58,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 686345294, now seen corresponding path program 2 times [2024-11-20 09:43:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:58,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17399978] [2024-11-20 09:43:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17399978] [2024-11-20 09:43:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17399978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:43:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90033163] [2024-11-20 09:43:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:43:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:43:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:43:58,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:43:58,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 834 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:43:58,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:58,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:43:58,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:58,820 INFO L124 PetriNetUnfolderBase]: 1540/2483 cut-off events. [2024-11-20 09:43:58,820 INFO L125 PetriNetUnfolderBase]: For 12251/12586 co-relation queries the response was YES. [2024-11-20 09:43:58,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11134 conditions, 2483 events. 1540/2483 cut-off events. For 12251/12586 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 14721 event pairs, 267 based on Foata normal form. 30/2409 useless extension candidates. Maximal degree in co-relation 8566. Up to 1995 conditions per place. [2024-11-20 09:43:58,853 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 71 selfloop transitions, 25 changer transitions 0/109 dead transitions. [2024-11-20 09:43:58,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 1144 flow [2024-11-20 09:43:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:43:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:43:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-20 09:43:58,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-11-20 09:43:58,855 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 834 flow. Second operand 5 states and 111 transitions. [2024-11-20 09:43:58,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 1144 flow [2024-11-20 09:43:58,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 1109 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-20 09:43:58,883 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 915 flow [2024-11-20 09:43:58,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=915, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2024-11-20 09:43:58,886 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2024-11-20 09:43:58,886 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 915 flow [2024-11-20 09:43:58,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:43:58,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:58,886 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] [2024-11-20 09:43:58,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:43:58,887 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 1 more)] === [2024-11-20 09:43:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1387687040, now seen corresponding path program 1 times [2024-11-20 09:43:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020753374] [2024-11-20 09:43:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020753374] [2024-11-20 09:43:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020753374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:43:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068049538] [2024-11-20 09:43:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:59,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:43:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:43:59,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:43:59,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-20 09:43:59,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 915 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:43:59,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:43:59,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-20 09:43:59,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:43:59,627 INFO L124 PetriNetUnfolderBase]: 2611/4222 cut-off events. [2024-11-20 09:43:59,627 INFO L125 PetriNetUnfolderBase]: For 20146/20434 co-relation queries the response was YES. [2024-11-20 09:43:59,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18385 conditions, 4222 events. 2611/4222 cut-off events. For 20146/20434 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25712 event pairs, 873 based on Foata normal form. 1/3906 useless extension candidates. Maximal degree in co-relation 15844. Up to 2374 conditions per place. [2024-11-20 09:43:59,670 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 71 selfloop transitions, 43 changer transitions 0/127 dead transitions. [2024-11-20 09:43:59,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 1351 flow [2024-11-20 09:43:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:43:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:43:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-20 09:43:59,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-20 09:43:59,672 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 915 flow. Second operand 5 states and 108 transitions. [2024-11-20 09:43:59,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 1351 flow [2024-11-20 09:43:59,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 127 transitions, 1299 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-20 09:43:59,753 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 1066 flow [2024-11-20 09:43:59,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1066, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2024-11-20 09:43:59,754 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2024-11-20 09:43:59,755 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 1066 flow [2024-11-20 09:43:59,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:43:59,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:43:59,755 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] [2024-11-20 09:43:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:43:59,755 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 1 more)] === [2024-11-20 09:43:59,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:43:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2095788596, now seen corresponding path program 2 times [2024-11-20 09:43:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:43:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437503310] [2024-11-20 09:43:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:43:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:43:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:43:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:43:59,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:43:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437503310] [2024-11-20 09:43:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437503310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:43:59,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:43:59,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:43:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965920155] [2024-11-20 09:43:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:43:59,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:43:59,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:43:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:43:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:00,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-20 09:44:00,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 1066 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:44:00,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:00,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-20 09:44:00,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:00,791 INFO L124 PetriNetUnfolderBase]: 3372/5322 cut-off events. [2024-11-20 09:44:00,791 INFO L125 PetriNetUnfolderBase]: For 38275/38780 co-relation queries the response was YES. [2024-11-20 09:44:00,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26271 conditions, 5322 events. 3372/5322 cut-off events. For 38275/38780 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 33277 event pairs, 501 based on Foata normal form. 36/5296 useless extension candidates. Maximal degree in co-relation 22364. Up to 2467 conditions per place. [2024-11-20 09:44:00,859 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 122 selfloop transitions, 82 changer transitions 2/219 dead transitions. [2024-11-20 09:44:00,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 219 transitions, 3189 flow [2024-11-20 09:44:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:44:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:44:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-11-20 09:44:00,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.63125 [2024-11-20 09:44:00,860 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 1066 flow. Second operand 5 states and 101 transitions. [2024-11-20 09:44:00,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 219 transitions, 3189 flow [2024-11-20 09:44:01,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 219 transitions, 3036 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-11-20 09:44:01,067 INFO L231 Difference]: Finished difference. Result has 94 places, 151 transitions, 2256 flow [2024-11-20 09:44:01,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2256, PETRI_PLACES=94, PETRI_TRANSITIONS=151} [2024-11-20 09:44:01,068 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 59 predicate places. [2024-11-20 09:44:01,068 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 151 transitions, 2256 flow [2024-11-20 09:44:01,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:44:01,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:01,069 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] [2024-11-20 09:44:01,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:44:01,070 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 1 more)] === [2024-11-20 09:44:01,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:01,070 INFO L85 PathProgramCache]: Analyzing trace with hash -318411364, now seen corresponding path program 3 times [2024-11-20 09:44:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:01,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294677082] [2024-11-20 09:44:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:01,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:01,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294677082] [2024-11-20 09:44:01,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294677082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:01,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:01,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:44:01,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251650943] [2024-11-20 09:44:01,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:01,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:01,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-20 09:44:01,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 151 transitions, 2256 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:44:01,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:01,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-20 09:44:01,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:02,308 INFO L124 PetriNetUnfolderBase]: 4223/6917 cut-off events. [2024-11-20 09:44:02,309 INFO L125 PetriNetUnfolderBase]: For 49010/49648 co-relation queries the response was YES. [2024-11-20 09:44:02,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36449 conditions, 6917 events. 4223/6917 cut-off events. For 49010/49648 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 46649 event pairs, 1077 based on Foata normal form. 41/6896 useless extension candidates. Maximal degree in co-relation 30830. Up to 3408 conditions per place. [2024-11-20 09:44:02,379 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 155 changer transitions 4/266 dead transitions. [2024-11-20 09:44:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 266 transitions, 4200 flow [2024-11-20 09:44:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:44:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:44:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-20 09:44:02,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-20 09:44:02,381 INFO L175 Difference]: Start difference. First operand has 94 places, 151 transitions, 2256 flow. Second operand 6 states and 126 transitions. [2024-11-20 09:44:02,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 266 transitions, 4200 flow [2024-11-20 09:44:02,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 266 transitions, 4196 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-20 09:44:02,546 INFO L231 Difference]: Finished difference. Result has 102 places, 210 transitions, 3777 flow [2024-11-20 09:44:02,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3777, PETRI_PLACES=102, PETRI_TRANSITIONS=210} [2024-11-20 09:44:02,551 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2024-11-20 09:44:02,551 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 210 transitions, 3777 flow [2024-11-20 09:44:02,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:44:02,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:02,552 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] [2024-11-20 09:44:02,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:44:02,552 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 1 more)] === [2024-11-20 09:44:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash 750086166, now seen corresponding path program 4 times [2024-11-20 09:44:02,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:02,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492284372] [2024-11-20 09:44:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:02,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492284372] [2024-11-20 09:44:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492284372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:44:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288655190] [2024-11-20 09:44:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:02,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:02,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-20 09:44:02,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 210 transitions, 3777 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:44:02,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:02,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-20 09:44:02,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:03,967 INFO L124 PetriNetUnfolderBase]: 4203/6971 cut-off events. [2024-11-20 09:44:03,968 INFO L125 PetriNetUnfolderBase]: For 64975/65629 co-relation queries the response was YES. [2024-11-20 09:44:04,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40686 conditions, 6971 events. 4203/6971 cut-off events. For 64975/65629 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 48051 event pairs, 684 based on Foata normal form. 48/6941 useless extension candidates. Maximal degree in co-relation 34458. Up to 2948 conditions per place. [2024-11-20 09:44:04,045 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 116 selfloop transitions, 143 changer transitions 4/276 dead transitions. [2024-11-20 09:44:04,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 276 transitions, 5029 flow [2024-11-20 09:44:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:44:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:44:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-11-20 09:44:04,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-11-20 09:44:04,048 INFO L175 Difference]: Start difference. First operand has 102 places, 210 transitions, 3777 flow. Second operand 5 states and 106 transitions. [2024-11-20 09:44:04,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 276 transitions, 5029 flow [2024-11-20 09:44:04,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 276 transitions, 5007 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-11-20 09:44:04,273 INFO L231 Difference]: Finished difference. Result has 110 places, 228 transitions, 4673 flow [2024-11-20 09:44:04,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3755, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4673, PETRI_PLACES=110, PETRI_TRANSITIONS=228} [2024-11-20 09:44:04,275 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2024-11-20 09:44:04,275 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 228 transitions, 4673 flow [2024-11-20 09:44:04,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-20 09:44:04,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:04,276 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] [2024-11-20 09:44:04,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:44:04,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:04,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1157206214, now seen corresponding path program 5 times [2024-11-20 09:44:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:04,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994450445] [2024-11-20 09:44:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:04,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:04,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994450445] [2024-11-20 09:44:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994450445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:04,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:04,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:44:04,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051851917] [2024-11-20 09:44:04,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:04,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:04,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-20 09:44:04,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 228 transitions, 4673 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-20 09:44:04,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:04,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-20 09:44:04,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:05,775 INFO L124 PetriNetUnfolderBase]: 5239/8265 cut-off events. [2024-11-20 09:44:05,776 INFO L125 PetriNetUnfolderBase]: For 96833/97423 co-relation queries the response was YES. [2024-11-20 09:44:05,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51677 conditions, 8265 events. 5239/8265 cut-off events. For 96833/97423 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 53294 event pairs, 1241 based on Foata normal form. 39/8261 useless extension candidates. Maximal degree in co-relation 43171. Up to 4329 conditions per place. [2024-11-20 09:44:05,927 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 187 changer transitions 3/304 dead transitions. [2024-11-20 09:44:05,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 304 transitions, 5983 flow [2024-11-20 09:44:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:44:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:44:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-20 09:44:05,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-20 09:44:05,928 INFO L175 Difference]: Start difference. First operand has 110 places, 228 transitions, 4673 flow. Second operand 6 states and 126 transitions. [2024-11-20 09:44:05,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 304 transitions, 5983 flow [2024-11-20 09:44:06,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 304 transitions, 5977 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-20 09:44:06,253 INFO L231 Difference]: Finished difference. Result has 118 places, 245 transitions, 5483 flow [2024-11-20 09:44:06,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4645, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5483, PETRI_PLACES=118, PETRI_TRANSITIONS=245} [2024-11-20 09:44:06,255 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2024-11-20 09:44:06,256 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 245 transitions, 5483 flow [2024-11-20 09:44:06,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-20 09:44:06,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:06,256 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] [2024-11-20 09:44:06,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:44:06,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 365433910, now seen corresponding path program 6 times [2024-11-20 09:44:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366213390] [2024-11-20 09:44:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366213390] [2024-11-20 09:44:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366213390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:44:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573849307] [2024-11-20 09:44:06,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 09:44:06,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:44:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:44:06,441 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-20 09:44:06,443 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-20 09:44:06,503 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-20 09:44:06,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 09:44:06,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 09:44:06,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:44:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:06,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:44:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:07,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573849307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:44:07,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:44:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-20 09:44:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088940200] [2024-11-20 09:44:07,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:44:07,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:44:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:07,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:44:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:44:07,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-20 09:44:07,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 245 transitions, 5483 flow. Second operand has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 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-20 09:44:07,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:07,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-20 09:44:07,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:09,577 INFO L124 PetriNetUnfolderBase]: 6801/10631 cut-off events. [2024-11-20 09:44:09,578 INFO L125 PetriNetUnfolderBase]: For 138048/138836 co-relation queries the response was YES. [2024-11-20 09:44:09,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70006 conditions, 10631 events. 6801/10631 cut-off events. For 138048/138836 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 69620 event pairs, 521 based on Foata normal form. 153/10753 useless extension candidates. Maximal degree in co-relation 58979. Up to 2847 conditions per place. [2024-11-20 09:44:09,655 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 177 selfloop transitions, 243 changer transitions 14/444 dead transitions. [2024-11-20 09:44:09,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 444 transitions, 8203 flow [2024-11-20 09:44:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 09:44:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-20 09:44:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 330 transitions. [2024-11-20 09:44:09,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64453125 [2024-11-20 09:44:09,657 INFO L175 Difference]: Start difference. First operand has 118 places, 245 transitions, 5483 flow. Second operand 16 states and 330 transitions. [2024-11-20 09:44:09,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 444 transitions, 8203 flow [2024-11-20 09:44:10,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 444 transitions, 7998 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-20 09:44:10,021 INFO L231 Difference]: Finished difference. Result has 138 places, 293 transitions, 6845 flow [2024-11-20 09:44:10,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5303, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6845, PETRI_PLACES=138, PETRI_TRANSITIONS=293} [2024-11-20 09:44:10,022 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2024-11-20 09:44:10,022 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 293 transitions, 6845 flow [2024-11-20 09:44:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 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-20 09:44:10,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:10,023 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] [2024-11-20 09:44:10,029 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-20 09:44:10,223 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,SelfDestructingSolverStorable12 [2024-11-20 09:44:10,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 284609908, now seen corresponding path program 3 times [2024-11-20 09:44:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616287426] [2024-11-20 09:44:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616287426] [2024-11-20 09:44:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616287426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:44:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607908226] [2024-11-20 09:44:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:10,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:10,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:44:10,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 293 transitions, 6845 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:44:10,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:10,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:44:10,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:11,655 INFO L124 PetriNetUnfolderBase]: 4813/7835 cut-off events. [2024-11-20 09:44:11,655 INFO L125 PetriNetUnfolderBase]: For 155497/156507 co-relation queries the response was YES. [2024-11-20 09:44:11,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59861 conditions, 7835 events. 4813/7835 cut-off events. For 155497/156507 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 53408 event pairs, 854 based on Foata normal form. 123/7697 useless extension candidates. Maximal degree in co-relation 50288. Up to 6295 conditions per place. [2024-11-20 09:44:11,754 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 235 selfloop transitions, 60 changer transitions 7/328 dead transitions. [2024-11-20 09:44:11,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 328 transitions, 7644 flow [2024-11-20 09:44:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:44:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:44:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-20 09:44:11,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-20 09:44:11,756 INFO L175 Difference]: Start difference. First operand has 138 places, 293 transitions, 6845 flow. Second operand 5 states and 108 transitions. [2024-11-20 09:44:11,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 328 transitions, 7644 flow [2024-11-20 09:44:12,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 328 transitions, 7380 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-11-20 09:44:12,355 INFO L231 Difference]: Finished difference. Result has 139 places, 283 transitions, 6462 flow [2024-11-20 09:44:12,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6293, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6462, PETRI_PLACES=139, PETRI_TRANSITIONS=283} [2024-11-20 09:44:12,358 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2024-11-20 09:44:12,358 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 283 transitions, 6462 flow [2024-11-20 09:44:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:44:12,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:12,359 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] [2024-11-20 09:44:12,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:44:12,360 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:12,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -915003742, now seen corresponding path program 7 times [2024-11-20 09:44:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143382016] [2024-11-20 09:44:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143382016] [2024-11-20 09:44:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143382016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:12,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:12,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:44:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396669718] [2024-11-20 09:44:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:12,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-20 09:44:12,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 283 transitions, 6462 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-20 09:44:12,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:12,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-20 09:44:12,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:14,000 INFO L124 PetriNetUnfolderBase]: 6007/9180 cut-off events. [2024-11-20 09:44:14,000 INFO L125 PetriNetUnfolderBase]: For 161900/162797 co-relation queries the response was YES. [2024-11-20 09:44:14,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67092 conditions, 9180 events. 6007/9180 cut-off events. For 161900/162797 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 57853 event pairs, 889 based on Foata normal form. 60/9192 useless extension candidates. Maximal degree in co-relation 55084. Up to 3898 conditions per place. [2024-11-20 09:44:14,082 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 160 selfloop transitions, 166 changer transitions 5/341 dead transitions. [2024-11-20 09:44:14,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 341 transitions, 7704 flow [2024-11-20 09:44:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:44:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:44:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-20 09:44:14,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-20 09:44:14,085 INFO L175 Difference]: Start difference. First operand has 139 places, 283 transitions, 6462 flow. Second operand 5 states and 105 transitions. [2024-11-20 09:44:14,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 341 transitions, 7704 flow [2024-11-20 09:44:14,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 341 transitions, 7337 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-20 09:44:14,508 INFO L231 Difference]: Finished difference. Result has 140 places, 280 transitions, 6484 flow [2024-11-20 09:44:14,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6023, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6484, PETRI_PLACES=140, PETRI_TRANSITIONS=280} [2024-11-20 09:44:14,509 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2024-11-20 09:44:14,509 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 280 transitions, 6484 flow [2024-11-20 09:44:14,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-20 09:44:14,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:14,510 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] [2024-11-20 09:44:14,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 09:44:14,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:14,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:14,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1474280036, now seen corresponding path program 8 times [2024-11-20 09:44:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680933136] [2024-11-20 09:44:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:14,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680933136] [2024-11-20 09:44:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680933136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:44:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860038259] [2024-11-20 09:44:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:14,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:44:14,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 280 transitions, 6484 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:44:14,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:14,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:44:14,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:15,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L83-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (<= (mod v_~L~0_44 4294967296) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {~L~0=v_~L~0_44} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, ~L~0=v_~L~0_44, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][57], [Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 144#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 101#true, 124#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 142#(or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), 181#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 154#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 151#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 9#thread3EXITtrue, Black: 161#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 164#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 16#L99-4true, Black: 160#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 136#true, Black: 172#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 175#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 49#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 53#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 31#L53true, Black: 65#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 60#(= ~N~0 ~L~0), 361#true, 370#true, Black: 63#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 62#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 51#(<= (mod ~L~0 4294967296) 0), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 179#true, Black: 76#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 335#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 84#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 7#thread2EXITtrue, Black: 286#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 71#true, Black: 184#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 341#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 333#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), 75#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 97#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 95#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 94#(< 0 (mod ~N~0 4294967296)), Black: 358#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 106#(<= 1 (mod ~L~0 4294967296)), Black: 104#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 367#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 103#(= ~N~0 ~L~0), Black: 364#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 116#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 119#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-20 09:44:15,719 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-11-20 09:44:15,719 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-20 09:44:15,719 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-20 09:44:15,719 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-20 09:44:15,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L83-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (<= (mod v_~L~0_44 4294967296) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {~L~0=v_~L~0_44} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, ~L~0=v_~L~0_44, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][57], [Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 144#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 101#true, 124#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 142#(or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), 181#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 154#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 151#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 9#thread3EXITtrue, Black: 161#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 164#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 160#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 136#true, Black: 172#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 175#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 25#L100true, Black: 49#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 53#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 31#L53true, Black: 65#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 60#(= ~N~0 ~L~0), 361#true, 370#true, Black: 63#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 62#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 51#(<= (mod ~L~0 4294967296) 0), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 179#true, Black: 76#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 335#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 84#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 7#thread2EXITtrue, Black: 286#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 71#true, Black: 184#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 341#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 333#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), 75#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 97#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 95#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 94#(< 0 (mod ~N~0 4294967296)), Black: 358#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 106#(<= 1 (mod ~L~0 4294967296)), Black: 104#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 367#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 103#(= ~N~0 ~L~0), Black: 364#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 116#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 119#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-20 09:44:15,865 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-11-20 09:44:15,865 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-11-20 09:44:15,865 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-20 09:44:15,865 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-20 09:44:16,298 INFO L124 PetriNetUnfolderBase]: 4994/7993 cut-off events. [2024-11-20 09:44:16,298 INFO L125 PetriNetUnfolderBase]: For 153069/154094 co-relation queries the response was YES. [2024-11-20 09:44:16,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60211 conditions, 7993 events. 4994/7993 cut-off events. For 153069/154094 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 53349 event pairs, 902 based on Foata normal form. 120/7884 useless extension candidates. Maximal degree in co-relation 49101. Up to 6417 conditions per place. [2024-11-20 09:44:16,372 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 144 selfloop transitions, 55 changer transitions 17/318 dead transitions. [2024-11-20 09:44:16,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 318 transitions, 7279 flow [2024-11-20 09:44:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:44:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:44:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-20 09:44:16,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-20 09:44:16,373 INFO L175 Difference]: Start difference. First operand has 140 places, 280 transitions, 6484 flow. Second operand 5 states and 105 transitions. [2024-11-20 09:44:16,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 318 transitions, 7279 flow [2024-11-20 09:44:16,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 318 transitions, 7043 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-11-20 09:44:16,700 INFO L231 Difference]: Finished difference. Result has 142 places, 277 transitions, 6284 flow [2024-11-20 09:44:16,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6238, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6284, PETRI_PLACES=142, PETRI_TRANSITIONS=277} [2024-11-20 09:44:16,701 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2024-11-20 09:44:16,701 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 277 transitions, 6284 flow [2024-11-20 09:44:16,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:44:16,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:16,702 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] [2024-11-20 09:44:16,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 09:44:16,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:16,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1439566944, now seen corresponding path program 9 times [2024-11-20 09:44:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:16,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289925797] [2024-11-20 09:44:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289925797] [2024-11-20 09:44:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289925797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:16,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:44:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009966578] [2024-11-20 09:44:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:44:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:44:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:44:16,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:44:16,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 277 transitions, 6284 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-20 09:44:16,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:16,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:44:16,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:18,402 INFO L124 PetriNetUnfolderBase]: 5433/8882 cut-off events. [2024-11-20 09:44:18,403 INFO L125 PetriNetUnfolderBase]: For 170106/171104 co-relation queries the response was YES. [2024-11-20 09:44:18,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66297 conditions, 8882 events. 5433/8882 cut-off events. For 170106/171104 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 61342 event pairs, 774 based on Foata normal form. 316/9001 useless extension candidates. Maximal degree in co-relation 58709. Up to 5234 conditions per place. [2024-11-20 09:44:18,525 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 172 selfloop transitions, 78 changer transitions 1/353 dead transitions. [2024-11-20 09:44:18,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 353 transitions, 7871 flow [2024-11-20 09:44:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:44:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:44:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-11-20 09:44:18,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2024-11-20 09:44:18,526 INFO L175 Difference]: Start difference. First operand has 142 places, 277 transitions, 6284 flow. Second operand 6 states and 125 transitions. [2024-11-20 09:44:18,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 353 transitions, 7871 flow [2024-11-20 09:44:18,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 353 transitions, 7524 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-11-20 09:44:18,960 INFO L231 Difference]: Finished difference. Result has 144 places, 293 transitions, 6527 flow [2024-11-20 09:44:18,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5988, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6527, PETRI_PLACES=144, PETRI_TRANSITIONS=293} [2024-11-20 09:44:18,960 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 109 predicate places. [2024-11-20 09:44:18,961 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 293 transitions, 6527 flow [2024-11-20 09:44:18,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-20 09:44:18,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:18,961 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] [2024-11-20 09:44:18,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 09:44:18,961 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1153080196, now seen corresponding path program 10 times [2024-11-20 09:44:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729659409] [2024-11-20 09:44:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:44:19,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:19,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729659409] [2024-11-20 09:44:19,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729659409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:44:19,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:44:19,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:44:19,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652985520] [2024-11-20 09:44:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:44:19,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:44:19,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:44:19,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:44:19,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-20 09:44:19,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 293 transitions, 6527 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:44:19,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:19,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-20 09:44:19,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:20,917 INFO L124 PetriNetUnfolderBase]: 5589/9175 cut-off events. [2024-11-20 09:44:20,917 INFO L125 PetriNetUnfolderBase]: For 187738/188883 co-relation queries the response was YES. [2024-11-20 09:44:20,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70782 conditions, 9175 events. 5589/9175 cut-off events. For 187738/188883 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 64226 event pairs, 975 based on Foata normal form. 147/9127 useless extension candidates. Maximal degree in co-relation 63443. Up to 7168 conditions per place. [2024-11-20 09:44:21,004 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 151 selfloop transitions, 80 changer transitions 5/334 dead transitions. [2024-11-20 09:44:21,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 334 transitions, 7458 flow [2024-11-20 09:44:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:44:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:44:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-11-20 09:44:21,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-20 09:44:21,006 INFO L175 Difference]: Start difference. First operand has 144 places, 293 transitions, 6527 flow. Second operand 6 states and 123 transitions. [2024-11-20 09:44:21,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 334 transitions, 7458 flow [2024-11-20 09:44:21,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 334 transitions, 7347 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-11-20 09:44:21,455 INFO L231 Difference]: Finished difference. Result has 146 places, 298 transitions, 6725 flow [2024-11-20 09:44:21,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6260, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6725, PETRI_PLACES=146, PETRI_TRANSITIONS=298} [2024-11-20 09:44:21,455 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2024-11-20 09:44:21,456 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 298 transitions, 6725 flow [2024-11-20 09:44:21,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-20 09:44:21,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:21,456 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] [2024-11-20 09:44:21,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 09:44:21,456 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:21,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1423963428, now seen corresponding path program 1 times [2024-11-20 09:44:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141329797] [2024-11-20 09:44:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:21,660 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-20 09:44:21,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141329797] [2024-11-20 09:44:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141329797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:44:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972020581] [2024-11-20 09:44:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:44:21,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:44:21,664 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-20 09:44:21,664 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-20 09:44:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:21,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 09:44:21,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:44:21,942 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-20 09:44:21,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:44:22,480 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-20 09:44:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972020581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:44:22,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:44:22,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-20 09:44:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158825400] [2024-11-20 09:44:22,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:44:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 09:44:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 09:44:22,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:44:22,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-20 09:44:22,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 298 transitions, 6725 flow. Second operand has 15 states, 15 states have (on average 14.0) internal successors, (210), 15 states have internal predecessors, (210), 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-20 09:44:22,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:22,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-20 09:44:22,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:26,672 INFO L124 PetriNetUnfolderBase]: 13673/21556 cut-off events. [2024-11-20 09:44:26,672 INFO L125 PetriNetUnfolderBase]: For 411605/412773 co-relation queries the response was YES. [2024-11-20 09:44:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159887 conditions, 21556 events. 13673/21556 cut-off events. For 411605/412773 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 160883 event pairs, 705 based on Foata normal form. 324/21794 useless extension candidates. Maximal degree in co-relation 151216. Up to 8853 conditions per place. [2024-11-20 09:44:26,891 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 497 selfloop transitions, 395 changer transitions 8/923 dead transitions. [2024-11-20 09:44:26,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 923 transitions, 20711 flow [2024-11-20 09:44:26,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 09:44:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-20 09:44:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 322 transitions. [2024-11-20 09:44:26,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2024-11-20 09:44:26,894 INFO L175 Difference]: Start difference. First operand has 146 places, 298 transitions, 6725 flow. Second operand 15 states and 322 transitions. [2024-11-20 09:44:26,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 923 transitions, 20711 flow [2024-11-20 09:44:28,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 923 transitions, 20454 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-11-20 09:44:28,206 INFO L231 Difference]: Finished difference. Result has 154 places, 603 transitions, 14912 flow [2024-11-20 09:44:28,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6492, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14912, PETRI_PLACES=154, PETRI_TRANSITIONS=603} [2024-11-20 09:44:28,207 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 119 predicate places. [2024-11-20 09:44:28,207 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 603 transitions, 14912 flow [2024-11-20 09:44:28,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.0) internal successors, (210), 15 states have internal predecessors, (210), 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-20 09:44:28,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:28,209 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] [2024-11-20 09:44:28,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 09:44:28,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:44:28,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:28,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 419469264, now seen corresponding path program 2 times [2024-11-20 09:44:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696144807] [2024-11-20 09:44:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:28,781 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-20 09:44:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:28,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696144807] [2024-11-20 09:44:28,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696144807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:44:28,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503074757] [2024-11-20 09:44:28,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 09:44:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:44:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:44:28,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:44:28,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 09:44:28,841 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 09:44:28,841 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 09:44:28,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 09:44:28,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:44:28,962 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-20 09:44:28,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:44:29,489 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-20 09:44:29,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503074757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:44:29,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:44:29,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-20 09:44:29,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024847845] [2024-11-20 09:44:29,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:44:29,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:44:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:29,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:44:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:44:29,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-20 09:44:29,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 603 transitions, 14912 flow. Second operand has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:44:29,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:29,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-20 09:44:29,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:44:34,833 INFO L124 PetriNetUnfolderBase]: 16238/25567 cut-off events. [2024-11-20 09:44:34,833 INFO L125 PetriNetUnfolderBase]: For 596683/598786 co-relation queries the response was YES. [2024-11-20 09:44:35,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207550 conditions, 25567 events. 16238/25567 cut-off events. For 596683/598786 co-relation queries the response was YES. Maximal size of possible extension queue 1876. Compared 195308 event pairs, 1885 based on Foata normal form. 578/25934 useless extension candidates. Maximal degree in co-relation 202710. Up to 18024 conditions per place. [2024-11-20 09:44:35,137 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 535 selfloop transitions, 420 changer transitions 5/983 dead transitions. [2024-11-20 09:44:35,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 983 transitions, 25692 flow [2024-11-20 09:44:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 09:44:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 09:44:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-11-20 09:44:35,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2024-11-20 09:44:35,139 INFO L175 Difference]: Start difference. First operand has 154 places, 603 transitions, 14912 flow. Second operand 11 states and 217 transitions. [2024-11-20 09:44:35,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 983 transitions, 25692 flow [2024-11-20 09:44:38,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 983 transitions, 24551 flow, removed 521 selfloop flow, removed 4 redundant places. [2024-11-20 09:44:38,055 INFO L231 Difference]: Finished difference. Result has 163 places, 823 transitions, 21470 flow [2024-11-20 09:44:38,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14075, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21470, PETRI_PLACES=163, PETRI_TRANSITIONS=823} [2024-11-20 09:44:38,056 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2024-11-20 09:44:38,057 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 823 transitions, 21470 flow [2024-11-20 09:44:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:44:38,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:44:38,057 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] [2024-11-20 09:44:38,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 09:44:38,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:44:38,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-20 09:44:38,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:44:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 591370744, now seen corresponding path program 1 times [2024-11-20 09:44:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:44:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54133352] [2024-11-20 09:44:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:44:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:38,411 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-20 09:44:38,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:44:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54133352] [2024-11-20 09:44:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54133352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:44:38,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717669832] [2024-11-20 09:44:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:44:38,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:44:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:44:38,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:44:38,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 09:44:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:44:38,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 09:44:38,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:44:38,815 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-20 09:44:38,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:44:39,311 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-20 09:44:39,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717669832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:44:39,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:44:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 21 [2024-11-20 09:44:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336728047] [2024-11-20 09:44:39,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:44:39,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 09:44:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:44:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 09:44:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-11-20 09:44:39,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-20 09:44:39,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 823 transitions, 21470 flow. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 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-20 09:44:39,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:44:39,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-20 09:44:39,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:45:01,117 INFO L124 PetriNetUnfolderBase]: 53111/79260 cut-off events. [2024-11-20 09:45:01,117 INFO L125 PetriNetUnfolderBase]: For 1719697/1719702 co-relation queries the response was YES. [2024-11-20 09:45:01,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638046 conditions, 79260 events. 53111/79260 cut-off events. For 1719697/1719702 co-relation queries the response was YES. Maximal size of possible extension queue 3536. Compared 602686 event pairs, 1694 based on Foata normal form. 1650/80908 useless extension candidates. Maximal degree in co-relation 629508. Up to 17912 conditions per place. [2024-11-20 09:45:02,508 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1821 selfloop transitions, 2741 changer transitions 0/4566 dead transitions. [2024-11-20 09:45:02,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 4566 transitions, 109428 flow [2024-11-20 09:45:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-20 09:45:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2024-11-20 09:45:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 1389 transitions. [2024-11-20 09:45:02,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5711348684210527 [2024-11-20 09:45:02,512 INFO L175 Difference]: Start difference. First operand has 163 places, 823 transitions, 21470 flow. Second operand 76 states and 1389 transitions. [2024-11-20 09:45:02,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 4566 transitions, 109428 flow