/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:43:39,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:43:39,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:43:39,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:43:39,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:43:39,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:43:39,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:43:39,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:43:39,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:43:39,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:43:39,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:43:39,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:43:39,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:43:39,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:43:39,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:43:39,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:43:39,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:43:39,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:43:39,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:43:39,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:43:39,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:43:39,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:43:39,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:43:39,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:43:39,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:43:39,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:43:39,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:43:39,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:43:39,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:43:39,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:43:39,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:43:39,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:43:39,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:43:39,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:43:39,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:43:39,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:43:39,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:43:39,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:43:39,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:43:39,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:43:39,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:43:39,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:43:39,408 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:43:39,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:43:39,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:43:39,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:43:39,410 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:43:39,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:43:39,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:43:39,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:43:39,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:43:39,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:43:39,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:43:39,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:43:39,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:43:39,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:43:39,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:43:39,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:43:39,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:43:39,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:43:39,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:43:39,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:43:39,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:43:39,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:43:39,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:43:39,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:43:39,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:43:39,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:43:39,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:43:39,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:43:39,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 05:43:39,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:43:39,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:43:39,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:43:39,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:43:39,761 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:43:39,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2022-12-06 05:43:40,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:43:41,183 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:43:41,184 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2022-12-06 05:43:41,189 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ef4b7fe/c5b8e083ab97436c92292a6bdc48b190/FLAG8eb705a6f [2022-12-06 05:43:41,203 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ef4b7fe/c5b8e083ab97436c92292a6bdc48b190 [2022-12-06 05:43:41,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:43:41,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:43:41,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:43:41,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:43:41,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:43:41,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd70955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41, skipping insertion in model container [2022-12-06 05:43:41,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:43:41,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:43:41,411 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1876,1889] [2022-12-06 05:43:41,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:43:41,423 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:43:41,445 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1876,1889] [2022-12-06 05:43:41,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:43:41,465 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:43:41,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41 WrapperNode [2022-12-06 05:43:41,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:43:41,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:43:41,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:43:41,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:43:41,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,504 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2022-12-06 05:43:41,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:43:41,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:43:41,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:43:41,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:43:41,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:43:41,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:43:41,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:43:41,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:43:41,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (1/1) ... [2022-12-06 05:43:41,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:43:41,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:41,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:43:41,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:43:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:43:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:43:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:43:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:43:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:43:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:43:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:43:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:43:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:43:41,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:43:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:43:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:43:41,624 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:43:41,699 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:43:41,701 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:43:41,823 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:43:41,829 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:43:41,829 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 05:43:41,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:41 BoogieIcfgContainer [2022-12-06 05:43:41,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:43:41,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:43:41,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:43:41,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:43:41,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:43:41" (1/3) ... [2022-12-06 05:43:41,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5630840e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:43:41, skipping insertion in model container [2022-12-06 05:43:41,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:41" (2/3) ... [2022-12-06 05:43:41,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5630840e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:43:41, skipping insertion in model container [2022-12-06 05:43:41,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:41" (3/3) ... [2022-12-06 05:43:41,838 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy1.wvr.c [2022-12-06 05:43:41,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:43:41,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:43:41,854 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:43:41,905 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:43:41,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 05:43:42,049 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2022-12-06 05:43:42,049 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:43:42,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-12-06 05:43:42,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 05:43:42,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2022-12-06 05:43:42,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:42,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 05:43:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2022-12-06 05:43:42,124 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-12-06 05:43:42,124 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:43:42,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-12-06 05:43:42,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 05:43:42,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 05:43:44,604 INFO L203 LiptonReduction]: Total number of compositions: 54 [2022-12-06 05:43:44,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:43:44,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@20a690b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:43:44,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:43:44,627 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-06 05:43:44,628 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:43:44,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:44,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:44,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash 945197104, now seen corresponding path program 1 times [2022-12-06 05:43:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:44,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921820652] [2022-12-06 05:43:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:44,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921820652] [2022-12-06 05:43:44,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921820652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:44,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:44,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:43:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803061678] [2022-12-06 05:43:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:45,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:43:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:43:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:43:45,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:45,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-12-06 05:43:45,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:45,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:45,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:45,074 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2022-12-06 05:43:45,074 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:43:45,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2022-12-06 05:43:45,077 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2022-12-06 05:43:45,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2022-12-06 05:43:45,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:43:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:43:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 05:43:45,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-06 05:43:45,088 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 24 transitions. [2022-12-06 05:43:45,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2022-12-06 05:43:45,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:43:45,092 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2022-12-06 05:43:45,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2022-12-06 05:43:45,098 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-06 05:43:45,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:45,099 INFO L89 Accepts]: Start accepts. Operand has 17 places, 15 transitions, 49 flow [2022-12-06 05:43:45,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:45,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:45,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-06 05:43:45,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 15 transitions, 49 flow [2022-12-06 05:43:45,121 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-06 05:43:45,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:43:45,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 8 conditions per place. [2022-12-06 05:43:45,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-06 05:43:45,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 05:43:45,124 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:45,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:43:45,125 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2022-12-06 05:43:45,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-12-06 05:43:45,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:45,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:45,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:43:45,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -764285359, now seen corresponding path program 1 times [2022-12-06 05:43:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:45,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022924777] [2022-12-06 05:43:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:45,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022924777] [2022-12-06 05:43:45,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022924777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:45,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:45,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:43:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597951770] [2022-12-06 05:43:45,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:45,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:43:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:45,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:43:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:43:45,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:45,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-06 05:43:45,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:45,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:45,308 INFO L130 PetriNetUnfolder]: 35/71 cut-off events. [2022-12-06 05:43:45,309 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 05:43:45,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 71 events. 35/71 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 6 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 55. Up to 45 conditions per place. [2022-12-06 05:43:45,310 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 15 selfloop transitions, 3 changer transitions 10/28 dead transitions. [2022-12-06 05:43:45,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 28 transitions, 135 flow [2022-12-06 05:43:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 05:43:45,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 05:43:45,311 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 4 states and 30 transitions. [2022-12-06 05:43:45,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 28 transitions, 135 flow [2022-12-06 05:43:45,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:43:45,313 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 59 flow [2022-12-06 05:43:45,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2022-12-06 05:43:45,313 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 2 predicate places. [2022-12-06 05:43:45,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:45,314 INFO L89 Accepts]: Start accepts. Operand has 20 places, 15 transitions, 59 flow [2022-12-06 05:43:45,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:45,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:45,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 15 transitions, 59 flow [2022-12-06 05:43:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 15 transitions, 59 flow [2022-12-06 05:43:45,318 INFO L130 PetriNetUnfolder]: 8/25 cut-off events. [2022-12-06 05:43:45,319 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:43:45,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 25 events. 8/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 30. Up to 10 conditions per place. [2022-12-06 05:43:45,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 15 transitions, 59 flow [2022-12-06 05:43:45,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 05:43:45,320 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:45,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:43:45,321 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 59 flow [2022-12-06 05:43:45,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-06 05:43:45,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:45,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:43:45,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -595036581, now seen corresponding path program 1 times [2022-12-06 05:43:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:45,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198436750] [2022-12-06 05:43:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:45,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198436750] [2022-12-06 05:43:45,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198436750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:45,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008914364] [2022-12-06 05:43:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:45,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:45,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:45,451 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) [2022-12-06 05:43:45,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:43:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:45,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:43:45,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:45,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:45,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008914364] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:45,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:43:45,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2022-12-06 05:43:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433387290] [2022-12-06 05:43:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:43:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:43:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:43:45,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:45,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 59 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-06 05:43:45,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:45,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:45,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:45,811 INFO L130 PetriNetUnfolder]: 60/118 cut-off events. [2022-12-06 05:43:45,811 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 05:43:45,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 118 events. 60/118 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 325 event pairs, 6 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 97. Up to 44 conditions per place. [2022-12-06 05:43:45,813 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 28 selfloop transitions, 9 changer transitions 4/41 dead transitions. [2022-12-06 05:43:45,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 224 flow [2022-12-06 05:43:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:43:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:43:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 05:43:45,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2022-12-06 05:43:45,814 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 59 flow. Second operand 5 states and 41 transitions. [2022-12-06 05:43:45,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 224 flow [2022-12-06 05:43:45,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 41 transitions, 212 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:45,816 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 123 flow [2022-12-06 05:43:45,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-06 05:43:45,817 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 05:43:45,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:45,817 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 123 flow [2022-12-06 05:43:45,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:45,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:45,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 123 flow [2022-12-06 05:43:45,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 123 flow [2022-12-06 05:43:45,824 INFO L130 PetriNetUnfolder]: 18/54 cut-off events. [2022-12-06 05:43:45,824 INFO L131 PetriNetUnfolder]: For 51/53 co-relation queries the response was YES. [2022-12-06 05:43:45,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 54 events. 18/54 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 2 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 122. Up to 19 conditions per place. [2022-12-06 05:43:45,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 123 flow [2022-12-06 05:43:45,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 05:43:45,826 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:45,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:43:45,827 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 123 flow [2022-12-06 05:43:45,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-06 05:43:45,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:45,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:45,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:46,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:46,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 894868563, now seen corresponding path program 2 times [2022-12-06 05:43:46,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:46,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042726909] [2022-12-06 05:43:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:46,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:46,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:46,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042726909] [2022-12-06 05:43:46,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042726909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:46,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:46,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:43:46,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262236915] [2022-12-06 05:43:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:46,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:43:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:43:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:43:46,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:46,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-06 05:43:46,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:46,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:46,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:46,205 INFO L130 PetriNetUnfolder]: 62/124 cut-off events. [2022-12-06 05:43:46,205 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 05:43:46,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 124 events. 62/124 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 343 event pairs, 12 based on Foata normal form. 8/132 useless extension candidates. Maximal degree in co-relation 251. Up to 106 conditions per place. [2022-12-06 05:43:46,207 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 24 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2022-12-06 05:43:46,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 218 flow [2022-12-06 05:43:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-06 05:43:46,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-06 05:43:46,208 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 123 flow. Second operand 4 states and 23 transitions. [2022-12-06 05:43:46,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 218 flow [2022-12-06 05:43:46,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 212 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 05:43:46,211 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 146 flow [2022-12-06 05:43:46,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2022-12-06 05:43:46,212 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 11 predicate places. [2022-12-06 05:43:46,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:46,212 INFO L89 Accepts]: Start accepts. Operand has 29 places, 22 transitions, 146 flow [2022-12-06 05:43:46,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:46,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:46,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 146 flow [2022-12-06 05:43:46,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 146 flow [2022-12-06 05:43:46,219 INFO L130 PetriNetUnfolder]: 17/57 cut-off events. [2022-12-06 05:43:46,219 INFO L131 PetriNetUnfolder]: For 82/85 co-relation queries the response was YES. [2022-12-06 05:43:46,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 57 events. 17/57 cut-off events. For 82/85 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 154 event pairs, 2 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 140. Up to 18 conditions per place. [2022-12-06 05:43:46,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 146 flow [2022-12-06 05:43:46,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 05:43:46,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:46,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:43:46,222 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 146 flow [2022-12-06 05:43:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-06 05:43:46,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:46,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:46,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:43:46,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1864852368, now seen corresponding path program 1 times [2022-12-06 05:43:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039184754] [2022-12-06 05:43:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:46,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039184754] [2022-12-06 05:43:46,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039184754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:46,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014112750] [2022-12-06 05:43:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:46,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:46,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:46,343 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) [2022-12-06 05:43:46,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:43:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:46,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:43:46,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:46,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:43:46,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014112750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:46,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:43:46,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-06 05:43:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590375021] [2022-12-06 05:43:46,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:43:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:43:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:43:46,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:46,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 146 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-12-06 05:43:46,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:46,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:46,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:46,556 INFO L130 PetriNetUnfolder]: 62/123 cut-off events. [2022-12-06 05:43:46,557 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-06 05:43:46,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 123 events. 62/123 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 353 event pairs, 4 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 261. Up to 42 conditions per place. [2022-12-06 05:43:46,558 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 24 selfloop transitions, 5 changer transitions 14/43 dead transitions. [2022-12-06 05:43:46,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 315 flow [2022-12-06 05:43:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:43:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:43:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-06 05:43:46,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 05:43:46,559 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 146 flow. Second operand 6 states and 34 transitions. [2022-12-06 05:43:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 315 flow [2022-12-06 05:43:46,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 302 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:46,567 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 153 flow [2022-12-06 05:43:46,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 05:43:46,570 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 17 predicate places. [2022-12-06 05:43:46,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:46,570 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 153 flow [2022-12-06 05:43:46,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:46,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:46,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 153 flow [2022-12-06 05:43:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 153 flow [2022-12-06 05:43:46,579 INFO L130 PetriNetUnfolder]: 14/50 cut-off events. [2022-12-06 05:43:46,579 INFO L131 PetriNetUnfolder]: For 124/128 co-relation queries the response was YES. [2022-12-06 05:43:46,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 50 events. 14/50 cut-off events. For 124/128 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 2 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 156. Up to 17 conditions per place. [2022-12-06 05:43:46,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 153 flow [2022-12-06 05:43:46,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:43:46,580 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:46,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:43:46,581 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 153 flow [2022-12-06 05:43:46,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-12-06 05:43:46,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:46,581 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:46,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:46,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 885987816, now seen corresponding path program 2 times [2022-12-06 05:43:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139270208] [2022-12-06 05:43:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:43:46,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:46,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139270208] [2022-12-06 05:43:46,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139270208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:46,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:46,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:43:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23252397] [2022-12-06 05:43:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:46,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:43:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:43:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:43:46,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:46,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-12-06 05:43:46,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:46,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:46,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:46,921 INFO L130 PetriNetUnfolder]: 52/110 cut-off events. [2022-12-06 05:43:46,922 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2022-12-06 05:43:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 110 events. 52/110 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 302 event pairs, 8 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 469. Up to 86 conditions per place. [2022-12-06 05:43:46,923 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 24 selfloop transitions, 4 changer transitions 3/31 dead transitions. [2022-12-06 05:43:46,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 260 flow [2022-12-06 05:43:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 05:43:46,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-06 05:43:46,924 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 153 flow. Second operand 4 states and 25 transitions. [2022-12-06 05:43:46,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 260 flow [2022-12-06 05:43:46,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 253 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:43:46,926 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 170 flow [2022-12-06 05:43:46,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-06 05:43:46,927 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 16 predicate places. [2022-12-06 05:43:46,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:46,927 INFO L89 Accepts]: Start accepts. Operand has 34 places, 23 transitions, 170 flow [2022-12-06 05:43:46,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:46,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:46,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 170 flow [2022-12-06 05:43:46,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 170 flow [2022-12-06 05:43:46,940 INFO L130 PetriNetUnfolder]: 11/47 cut-off events. [2022-12-06 05:43:46,940 INFO L131 PetriNetUnfolder]: For 134/142 co-relation queries the response was YES. [2022-12-06 05:43:46,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 47 events. 11/47 cut-off events. For 134/142 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 2 based on Foata normal form. 3/50 useless extension candidates. Maximal degree in co-relation 127. Up to 15 conditions per place. [2022-12-06 05:43:46,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 170 flow [2022-12-06 05:43:46,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 05:43:46,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:46,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:43:46,944 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 170 flow [2022-12-06 05:43:46,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-12-06 05:43:46,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:46,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:46,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:43:46,945 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1917290398, now seen corresponding path program 2 times [2022-12-06 05:43:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:46,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509672962] [2022-12-06 05:43:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:46,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:47,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509672962] [2022-12-06 05:43:47,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509672962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:47,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486060300] [2022-12-06 05:43:47,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:43:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:47,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:47,055 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) [2022-12-06 05:43:47,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:43:47,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:43:47,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:43:47,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:43:47,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:47,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:43:47,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486060300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:47,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:47,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 9 [2022-12-06 05:43:47,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577251900] [2022-12-06 05:43:47,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:47,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:43:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:47,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:43:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:43:47,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:43:47,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 170 flow. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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) [2022-12-06 05:43:47,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:47,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:43:47,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:47,371 INFO L130 PetriNetUnfolder]: 86/196 cut-off events. [2022-12-06 05:43:47,371 INFO L131 PetriNetUnfolder]: For 563/563 co-relation queries the response was YES. [2022-12-06 05:43:47,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 196 events. 86/196 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 749 event pairs, 4 based on Foata normal form. 7/203 useless extension candidates. Maximal degree in co-relation 287. Up to 80 conditions per place. [2022-12-06 05:43:47,373 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 35 selfloop transitions, 14 changer transitions 7/56 dead transitions. [2022-12-06 05:43:47,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 466 flow [2022-12-06 05:43:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:43:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:43:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-06 05:43:47,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2022-12-06 05:43:47,374 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 170 flow. Second operand 7 states and 47 transitions. [2022-12-06 05:43:47,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 466 flow [2022-12-06 05:43:47,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:47,377 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 294 flow [2022-12-06 05:43:47,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=294, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-06 05:43:47,378 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 24 predicate places. [2022-12-06 05:43:47,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:47,378 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 294 flow [2022-12-06 05:43:47,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:47,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:47,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 294 flow [2022-12-06 05:43:47,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 294 flow [2022-12-06 05:43:47,387 INFO L130 PetriNetUnfolder]: 18/82 cut-off events. [2022-12-06 05:43:47,387 INFO L131 PetriNetUnfolder]: For 336/355 co-relation queries the response was YES. [2022-12-06 05:43:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 82 events. 18/82 cut-off events. For 336/355 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 309 event pairs, 1 based on Foata normal form. 4/85 useless extension candidates. Maximal degree in co-relation 289. Up to 27 conditions per place. [2022-12-06 05:43:47,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 294 flow [2022-12-06 05:43:47,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 05:43:47,389 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L41-1-->L41-1: Formula: (and (= v_~x1~0_45 (+ v_~x1~0_46 1)) (< v_~x1~0_46 10000)) InVars {~x1~0=v_~x1~0_46} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, ~x1~0=v_~x1~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~x1~0] and [239] L49-1-->L49-1: Formula: (and (< v_~x2~0_38 10000) (= (+ v_~x2~0_38 1) v_~x2~0_37)) InVars {~x2~0=v_~x2~0_38} OutVars{~x2~0=v_~x2~0_37, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_17|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post2] [2022-12-06 05:43:47,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:43:47,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:43:47,413 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 301 flow [2022-12-06 05:43:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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) [2022-12-06 05:43:47,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:47,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:47,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:47,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:47,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -171592976, now seen corresponding path program 3 times [2022-12-06 05:43:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:47,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543305602] [2022-12-06 05:43:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:47,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543305602] [2022-12-06 05:43:47,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543305602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:47,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427820985] [2022-12-06 05:43:47,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:43:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:47,728 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) [2022-12-06 05:43:47,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:43:47,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:43:47,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:43:47,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:43:47,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:47,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:43:47,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427820985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:47,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:43:47,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-06 05:43:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649209024] [2022-12-06 05:43:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:47,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:43:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:47,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:43:47,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:43:47,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 05:43:47,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 301 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-12-06 05:43:47,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:47,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 05:43:47,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:47,907 INFO L130 PetriNetUnfolder]: 81/183 cut-off events. [2022-12-06 05:43:47,907 INFO L131 PetriNetUnfolder]: For 986/986 co-relation queries the response was YES. [2022-12-06 05:43:47,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 183 events. 81/183 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 12 based on Foata normal form. 3/186 useless extension candidates. Maximal degree in co-relation 616. Up to 61 conditions per place. [2022-12-06 05:43:47,909 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 28 selfloop transitions, 4 changer transitions 21/53 dead transitions. [2022-12-06 05:43:47,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 591 flow [2022-12-06 05:43:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:43:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:43:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-12-06 05:43:47,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 05:43:47,910 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 301 flow. Second operand 6 states and 33 transitions. [2022-12-06 05:43:47,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 591 flow [2022-12-06 05:43:47,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 548 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:47,915 INFO L231 Difference]: Finished difference. Result has 48 places, 26 transitions, 246 flow [2022-12-06 05:43:47,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=48, PETRI_TRANSITIONS=26} [2022-12-06 05:43:47,916 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-06 05:43:47,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:47,916 INFO L89 Accepts]: Start accepts. Operand has 48 places, 26 transitions, 246 flow [2022-12-06 05:43:47,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:47,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:47,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 26 transitions, 246 flow [2022-12-06 05:43:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 26 transitions, 246 flow [2022-12-06 05:43:47,922 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-06 05:43:47,922 INFO L131 PetriNetUnfolder]: For 200/206 co-relation queries the response was YES. [2022-12-06 05:43:47,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 38 events. 11/38 cut-off events. For 200/206 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 72 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 172. Up to 14 conditions per place. [2022-12-06 05:43:47,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 26 transitions, 246 flow [2022-12-06 05:43:47,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:43:47,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [239] L49-1-->L49-1: Formula: (and (< v_~x2~0_38 10000) (= (+ v_~x2~0_38 1) v_~x2~0_37)) InVars {~x2~0=v_~x2~0_38} OutVars{~x2~0=v_~x2~0_37, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_17|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post2] and [247] L41-1-->L41-1: Formula: (and (= v_~x1~0_45 (+ v_~x1~0_46 1)) (< v_~x1~0_46 10000)) InVars {~x1~0=v_~x1~0_46} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, ~x1~0=v_~x1~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~x1~0] [2022-12-06 05:43:48,015 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:43:48,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 05:43:48,016 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 275 flow [2022-12-06 05:43:48,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-12-06 05:43:48,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:48,017 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:48,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:48,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:48,221 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1234871207, now seen corresponding path program 4 times [2022-12-06 05:43:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688227285] [2022-12-06 05:43:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688227285] [2022-12-06 05:43:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688227285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123752725] [2022-12-06 05:43:48,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:43:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:48,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:48,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:43:48,346 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:43:48,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:43:48,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:43:48,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:48,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:48,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123752725] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:48,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:48,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:43:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273543913] [2022-12-06 05:43:48,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:48,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:43:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:48,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:43:48,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:43:48,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:43:48,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 275 flow. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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) [2022-12-06 05:43:48,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:48,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:43:48,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:48,632 INFO L130 PetriNetUnfolder]: 83/180 cut-off events. [2022-12-06 05:43:48,632 INFO L131 PetriNetUnfolder]: For 1332/1332 co-relation queries the response was YES. [2022-12-06 05:43:48,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 180 events. 83/180 cut-off events. For 1332/1332 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 638 event pairs, 6 based on Foata normal form. 20/200 useless extension candidates. Maximal degree in co-relation 967. Up to 63 conditions per place. [2022-12-06 05:43:48,634 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 33 selfloop transitions, 29 changer transitions 20/82 dead transitions. [2022-12-06 05:43:48,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 850 flow [2022-12-06 05:43:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:43:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:43:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-12-06 05:43:48,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33031674208144796 [2022-12-06 05:43:48,636 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 275 flow. Second operand 13 states and 73 transitions. [2022-12-06 05:43:48,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 850 flow [2022-12-06 05:43:48,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 743 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-06 05:43:48,642 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 499 flow [2022-12-06 05:43:48,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=499, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2022-12-06 05:43:48,643 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 39 predicate places. [2022-12-06 05:43:48,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:48,643 INFO L89 Accepts]: Start accepts. Operand has 57 places, 45 transitions, 499 flow [2022-12-06 05:43:48,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:48,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:48,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 499 flow [2022-12-06 05:43:48,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 499 flow [2022-12-06 05:43:48,651 INFO L130 PetriNetUnfolder]: 20/58 cut-off events. [2022-12-06 05:43:48,651 INFO L131 PetriNetUnfolder]: For 343/350 co-relation queries the response was YES. [2022-12-06 05:43:48,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 58 events. 20/58 cut-off events. For 343/350 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 300. Up to 29 conditions per place. [2022-12-06 05:43:48,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 499 flow [2022-12-06 05:43:48,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:43:48,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:48,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:43:48,655 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 499 flow [2022-12-06 05:43:48,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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) [2022-12-06 05:43:48,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:48,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:48,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:48,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:48,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash 948558989, now seen corresponding path program 1 times [2022-12-06 05:43:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:48,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623959315] [2022-12-06 05:43:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:48,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623959315] [2022-12-06 05:43:48,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623959315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:48,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:48,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:43:48,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021823670] [2022-12-06 05:43:48,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:48,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:43:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:43:48,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:43:48,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:43:48,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-06 05:43:48,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:48,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:43:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:49,011 INFO L130 PetriNetUnfolder]: 82/167 cut-off events. [2022-12-06 05:43:49,011 INFO L131 PetriNetUnfolder]: For 1353/1353 co-relation queries the response was YES. [2022-12-06 05:43:49,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 167 events. 82/167 cut-off events. For 1353/1353 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 522 event pairs, 13 based on Foata normal form. 2/169 useless extension candidates. Maximal degree in co-relation 916. Up to 125 conditions per place. [2022-12-06 05:43:49,013 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 49 selfloop transitions, 6 changer transitions 3/58 dead transitions. [2022-12-06 05:43:49,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 709 flow [2022-12-06 05:43:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 05:43:49,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2022-12-06 05:43:49,014 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 499 flow. Second operand 4 states and 30 transitions. [2022-12-06 05:43:49,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 709 flow [2022-12-06 05:43:49,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 527 flow, removed 87 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:49,021 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 351 flow [2022-12-06 05:43:49,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-06 05:43:49,021 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 40 predicate places. [2022-12-06 05:43:49,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:49,022 INFO L89 Accepts]: Start accepts. Operand has 58 places, 45 transitions, 351 flow [2022-12-06 05:43:49,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:49,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:49,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 45 transitions, 351 flow [2022-12-06 05:43:49,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 351 flow [2022-12-06 05:43:49,031 INFO L130 PetriNetUnfolder]: 20/66 cut-off events. [2022-12-06 05:43:49,031 INFO L131 PetriNetUnfolder]: For 334/338 co-relation queries the response was YES. [2022-12-06 05:43:49,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 66 events. 20/66 cut-off events. For 334/338 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 180 event pairs, 0 based on Foata normal form. 3/69 useless extension candidates. Maximal degree in co-relation 233. Up to 14 conditions per place. [2022-12-06 05:43:49,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 351 flow [2022-12-06 05:43:49,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:43:49,033 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:49,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:43:49,034 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 351 flow [2022-12-06 05:43:49,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-06 05:43:49,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:49,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:49,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:43:49,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1186746155, now seen corresponding path program 1 times [2022-12-06 05:43:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:49,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434293472] [2022-12-06 05:43:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:43:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:49,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434293472] [2022-12-06 05:43:49,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434293472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:49,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:49,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:43:49,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013391025] [2022-12-06 05:43:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:49,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:43:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:49,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:43:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:43:49,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:43:49,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-12-06 05:43:49,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:49,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:43:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:49,140 INFO L130 PetriNetUnfolder]: 75/148 cut-off events. [2022-12-06 05:43:49,140 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2022-12-06 05:43:49,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 148 events. 75/148 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 427 event pairs, 6 based on Foata normal form. 2/150 useless extension candidates. Maximal degree in co-relation 611. Up to 125 conditions per place. [2022-12-06 05:43:49,142 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 42 selfloop transitions, 8 changer transitions 1/51 dead transitions. [2022-12-06 05:43:49,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 490 flow [2022-12-06 05:43:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 05:43:49,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:43:49,143 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 351 flow. Second operand 4 states and 25 transitions. [2022-12-06 05:43:49,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 490 flow [2022-12-06 05:43:49,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 474 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:49,148 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 357 flow [2022-12-06 05:43:49,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-06 05:43:49,148 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 40 predicate places. [2022-12-06 05:43:49,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:49,149 INFO L89 Accepts]: Start accepts. Operand has 58 places, 45 transitions, 357 flow [2022-12-06 05:43:49,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:49,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:49,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 45 transitions, 357 flow [2022-12-06 05:43:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 357 flow [2022-12-06 05:43:49,156 INFO L130 PetriNetUnfolder]: 20/60 cut-off events. [2022-12-06 05:43:49,157 INFO L131 PetriNetUnfolder]: For 288/292 co-relation queries the response was YES. [2022-12-06 05:43:49,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 60 events. 20/60 cut-off events. For 288/292 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 3/63 useless extension candidates. Maximal degree in co-relation 216. Up to 14 conditions per place. [2022-12-06 05:43:49,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 45 transitions, 357 flow [2022-12-06 05:43:49,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:43:49,159 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:49,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:43:49,160 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 357 flow [2022-12-06 05:43:49,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-12-06 05:43:49,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:49,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:49,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:43:49,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 553515367, now seen corresponding path program 1 times [2022-12-06 05:43:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358231344] [2022-12-06 05:43:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:49,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358231344] [2022-12-06 05:43:49,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358231344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:49,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72652882] [2022-12-06 05:43:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:49,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:49,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:49,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:49,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:43:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:49,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:43:49,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:49,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:43:49,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72652882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:49,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:43:49,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 05:43:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142630845] [2022-12-06 05:43:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:43:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:43:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:43:49,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:43:49,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 357 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2022-12-06 05:43:49,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:49,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:43:49,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:49,483 INFO L130 PetriNetUnfolder]: 86/173 cut-off events. [2022-12-06 05:43:49,483 INFO L131 PetriNetUnfolder]: For 1292/1292 co-relation queries the response was YES. [2022-12-06 05:43:49,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 173 events. 86/173 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 546 event pairs, 8 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 746. Up to 94 conditions per place. [2022-12-06 05:43:49,484 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 17 selfloop transitions, 1 changer transitions 44/62 dead transitions. [2022-12-06 05:43:49,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 586 flow [2022-12-06 05:43:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:43:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:43:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-12-06 05:43:49,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-06 05:43:49,486 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 357 flow. Second operand 6 states and 32 transitions. [2022-12-06 05:43:49,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 586 flow [2022-12-06 05:43:49,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 564 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:43:49,491 INFO L231 Difference]: Finished difference. Result has 62 places, 17 transitions, 119 flow [2022-12-06 05:43:49,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=62, PETRI_TRANSITIONS=17} [2022-12-06 05:43:49,492 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 44 predicate places. [2022-12-06 05:43:49,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:49,492 INFO L89 Accepts]: Start accepts. Operand has 62 places, 17 transitions, 119 flow [2022-12-06 05:43:49,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:49,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:49,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 17 transitions, 119 flow [2022-12-06 05:43:49,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 17 transitions, 119 flow [2022-12-06 05:43:49,497 INFO L130 PetriNetUnfolder]: 2/18 cut-off events. [2022-12-06 05:43:49,497 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-06 05:43:49,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 18 events. 2/18 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 68. Up to 5 conditions per place. [2022-12-06 05:43:49,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 17 transitions, 119 flow [2022-12-06 05:43:49,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 05:43:49,550 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:43:49,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 05:43:49,551 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 15 transitions, 113 flow [2022-12-06 05:43:49,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2022-12-06 05:43:49,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:49,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:49,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:49,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:49,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:49,757 INFO L85 PathProgramCache]: Analyzing trace with hash -607981337, now seen corresponding path program 1 times [2022-12-06 05:43:49,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:49,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761008841] [2022-12-06 05:43:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:49,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761008841] [2022-12-06 05:43:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761008841] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943527968] [2022-12-06 05:43:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:49,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:49,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:49,848 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:49,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:43:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:49,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:43:49,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:49,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:43:49,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943527968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:49,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:43:49,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 05:43:49,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819095592] [2022-12-06 05:43:49,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:49,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:43:49,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:49,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:43:49,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:43:49,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:43:49,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 15 transitions, 113 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-12-06 05:43:49,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:49,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:43:49,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:50,008 INFO L130 PetriNetUnfolder]: 15/37 cut-off events. [2022-12-06 05:43:50,008 INFO L131 PetriNetUnfolder]: For 438/438 co-relation queries the response was YES. [2022-12-06 05:43:50,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 37 events. 15/37 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 209. Up to 13 conditions per place. [2022-12-06 05:43:50,008 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 0 selfloop transitions, 0 changer transitions 23/23 dead transitions. [2022-12-06 05:43:50,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 23 transitions, 195 flow [2022-12-06 05:43:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:43:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:43:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-12-06 05:43:50,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-06 05:43:50,010 INFO L175 Difference]: Start difference. First operand has 49 places, 15 transitions, 113 flow. Second operand 6 states and 24 transitions. [2022-12-06 05:43:50,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 23 transitions, 195 flow [2022-12-06 05:43:50,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 132 flow, removed 19 selfloop flow, removed 20 redundant places. [2022-12-06 05:43:50,011 INFO L231 Difference]: Finished difference. Result has 33 places, 0 transitions, 0 flow [2022-12-06 05:43:50,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=33, PETRI_TRANSITIONS=0} [2022-12-06 05:43:50,012 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 15 predicate places. [2022-12-06 05:43:50,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:50,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 0 transitions, 0 flow [2022-12-06 05:43:50,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:43:50,013 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:43:50,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:43:50,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:43:50,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:43:50,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:43:50,013 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:50,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 05:43:50,015 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:43:50,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-12-06 05:43:50,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:43:50,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:43:50,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:43:50,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:50,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:50,222 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2022-12-06 05:43:50,225 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:43:50,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:43:50,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:43:50 BasicIcfg [2022-12-06 05:43:50,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:43:50,228 INFO L158 Benchmark]: Toolchain (without parser) took 9021.54ms. Allocated memory was 189.8MB in the beginning and 281.0MB in the end (delta: 91.2MB). Free memory was 166.1MB in the beginning and 116.2MB in the end (delta: 49.9MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. [2022-12-06 05:43:50,228 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory was 166.5MB in the beginning and 166.5MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:43:50,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.47ms. Allocated memory is still 189.8MB. Free memory was 166.1MB in the beginning and 155.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 05:43:50,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 189.8MB. Free memory was 155.6MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:43:50,228 INFO L158 Benchmark]: Boogie Preprocessor took 35.44ms. Allocated memory is still 189.8MB. Free memory was 154.1MB in the beginning and 152.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:43:50,229 INFO L158 Benchmark]: RCFGBuilder took 289.75ms. Allocated memory is still 189.8MB. Free memory was 152.5MB in the beginning and 141.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:43:50,229 INFO L158 Benchmark]: TraceAbstraction took 8394.58ms. Allocated memory was 189.8MB in the beginning and 281.0MB in the end (delta: 91.2MB). Free memory was 139.9MB in the beginning and 116.2MB in the end (delta: 23.7MB). Peak memory consumption was 115.4MB. Max. memory is 8.0GB. [2022-12-06 05:43:50,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory was 166.5MB in the beginning and 166.5MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.47ms. Allocated memory is still 189.8MB. Free memory was 166.1MB in the beginning and 155.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 189.8MB. Free memory was 155.6MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.44ms. Allocated memory is still 189.8MB. Free memory was 154.1MB in the beginning and 152.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 289.75ms. Allocated memory is still 189.8MB. Free memory was 152.5MB in the beginning and 141.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8394.58ms. Allocated memory was 189.8MB in the beginning and 281.0MB in the end (delta: 91.2MB). Free memory was 139.9MB in the beginning and 116.2MB in the end (delta: 23.7MB). Peak memory consumption was 115.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 68 PlacesBefore, 18 PlacesAfterwards, 67 TransitionsBefore, 13 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 54 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 189, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 189, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 189, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 189, unknown conditional: 0, unknown unconditional: 189] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 310, Positive conditional cache size: 0, Positive unconditional cache size: 310, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 17 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 52 PlacesBefore, 49 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 70]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 874 IncrementalHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 0 mSDtfsCounter, 874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=499occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 1393 SizeOfPredicates, 6 NumberOfNonLiveVariables, 776 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 31/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:43:50,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...