/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:16:56,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:16:56,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:16:56,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:16:56,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:16:56,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:16:56,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:16:56,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:16:56,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:16:56,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:16:56,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:16:56,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:16:56,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:16:56,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:16:56,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:16:56,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:16:56,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:16:56,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:16:56,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:16:56,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:16:56,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:16:56,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:16:56,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:16:56,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:16:56,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:16:56,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:16:56,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:16:56,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:16:56,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:16:56,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:16:56,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:16:56,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:16:56,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:16:56,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:16:56,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:16:56,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:16:56,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:16:56,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:16:56,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:16:56,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:16:56,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:16:56,968 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-RepeatedSemanticLbe.epf [2022-12-06 00:16:56,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:16:56,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:16:56,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:16:56,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:16:56,995 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:16:56,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:16:56,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:16:56,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:16:56,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:16:56,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:16:56,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:16:56,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:16:56,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:16:56,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:16:56,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:16:56,999 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 00:16:57,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:16:57,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:16:57,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:16:57,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:16:57,288 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:16:57,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-06 00:16:58,343 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:16:58,510 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:16:58,511 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-06 00:16:58,522 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce40afe5/a440f48e1bf444718ea0e6262e28b1c9/FLAG5f4f9aef6 [2022-12-06 00:16:58,550 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce40afe5/a440f48e1bf444718ea0e6262e28b1c9 [2022-12-06 00:16:58,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:16:58,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:16:58,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:16:58,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:16:58,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:16:58,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc3edf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58, skipping insertion in model container [2022-12-06 00:16:58,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:16:58,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:16:58,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,753 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/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-06 00:16:58,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:16:58,769 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:16:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:58,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:58,787 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/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-06 00:16:58,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:16:58,806 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:16:58,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58 WrapperNode [2022-12-06 00:16:58,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:16:58,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:16:58,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:16:58,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:16:58,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,849 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-06 00:16:58,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:16:58,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:16:58,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:16:58,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:16:58,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,877 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:16:58,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:16:58,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:16:58,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:16:58,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (1/1) ... [2022-12-06 00:16:58,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:16:58,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:16:58,936 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 00:16:58,968 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 00:16:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:16:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:16:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:16:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:16:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:16:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:16:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:16:58,989 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 00:16:59,104 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:16:59,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:16:59,373 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:16:59,453 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:16:59,453 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:16:59,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:16:59 BoogieIcfgContainer [2022-12-06 00:16:59,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:16:59,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:16:59,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:16:59,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:16:59,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:16:58" (1/3) ... [2022-12-06 00:16:59,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4772e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:16:59, skipping insertion in model container [2022-12-06 00:16:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:58" (2/3) ... [2022-12-06 00:16:59,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4772e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:16:59, skipping insertion in model container [2022-12-06 00:16:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:16:59" (3/3) ... [2022-12-06 00:16:59,468 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-06 00:16:59,494 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:16:59,494 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:16:59,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:16:59,556 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:16:59,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 00:16:59,670 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-06 00:16:59,670 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:16:59,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 00:16:59,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 00:16:59,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:59,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:59,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:59,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:59,742 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-06 00:16:59,743 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:16:59,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 00:16:59,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:59,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 00:17:05,295 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 00:17:05,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:17:05,316 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;@212b9d4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:17:05,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:17:05,326 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 00:17:05,326 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:17:05,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:05,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:05,327 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 00:17:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-06 00:17:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:05,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698481534] [2022-12-06 00:17:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:05,749 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 00:17:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:05,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698481534] [2022-12-06 00:17:05,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698481534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:05,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:05,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:17:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237186039] [2022-12-06 00:17:05,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:17:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:05,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:17:05,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:17:05,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:17:05,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 00:17:05,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:05,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:17:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:05,873 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-06 00:17:05,874 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 00:17:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-06 00:17:05,878 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 00:17:05,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-06 00:17:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:17:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:17:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 00:17:05,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 00:17:05,889 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-06 00:17:05,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-06 00:17:05,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:17:05,892 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-06 00:17:05,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-06 00:17:05,896 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-06 00:17:05,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:05,897 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 00:17:05,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:05,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:05,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 00:17:05,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 00:17:05,912 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 00:17:05,912 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:17:05,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 29 events. 6/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2022-12-06 00:17:05,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 00:17:05,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 00:17:05,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:05,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 00:17:05,936 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-06 00:17:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 00:17:05,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:05,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:05,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:17:05,937 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 00:17:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-06 00:17:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:05,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817925812] [2022-12-06 00:17:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:06,023 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 00:17:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817925812] [2022-12-06 00:17:06,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817925812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:06,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:06,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:17:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704642120] [2022-12-06 00:17:06,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:06,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:17:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:06,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:17:06,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:17:06,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:17:06,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 00:17:06,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:06,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:17:06,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:06,099 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-06 00:17:06,099 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 00:17:06,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-06 00:17:06,101 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-06 00:17:06,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-06 00:17:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:17:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:17:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 00:17:06,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 00:17:06,102 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-06 00:17:06,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-06 00:17:06,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:17:06,103 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-06 00:17:06,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-06 00:17:06,104 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-06 00:17:06,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:06,104 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 00:17:06,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:06,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:06,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 00:17:06,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 00:17:06,108 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-06 00:17:06,108 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:17:06,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-06 00:17:06,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 00:17:06,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 00:17:06,395 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:17:06,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 00:17:06,396 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-06 00:17:06,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 00:17:06,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:06,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:06,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:17:06,397 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 00:17:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-06 00:17:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:06,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585462237] [2022-12-06 00:17:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:06,490 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 00:17:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585462237] [2022-12-06 00:17:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585462237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:06,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:06,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:17:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991776965] [2022-12-06 00:17:06,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:06,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:17:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:17:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:17:06,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:17:06,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 00:17:06,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:06,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:17:06,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:06,595 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-06 00:17:06,595 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 00:17:06,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 381 events. 228/381 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 858. Up to 212 conditions per place. [2022-12-06 00:17:06,597 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-06 00:17:06,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-06 00:17:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:17:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:17:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 00:17:06,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 00:17:06,598 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-06 00:17:06,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-06 00:17:06,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 244 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 00:17:06,600 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-06 00:17:06,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=30, PETRI_TRANSITIONS=39} [2022-12-06 00:17:06,601 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-06 00:17:06,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:06,601 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 00:17:06,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:06,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:06,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 00:17:06,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 00:17:06,608 INFO L130 PetriNetUnfolder]: 29/82 cut-off events. [2022-12-06 00:17:06,608 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 00:17:06,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 82 events. 29/82 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 168. Up to 28 conditions per place. [2022-12-06 00:17:06,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 00:17:06,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 00:17:06,616 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:06,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:17:06,617 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-06 00:17:06,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 00:17:06,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:06,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:06,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:17:06,618 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 00:17:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:06,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-06 00:17:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762095911] [2022-12-06 00:17:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:17:06,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:06,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762095911] [2022-12-06 00:17:06,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762095911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:06,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:06,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:17:06,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332766814] [2022-12-06 00:17:06,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:06,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:17:06,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:06,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:17:06,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:17:06,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 00:17:06,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 00:17:06,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:06,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 00:17:06,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:06,777 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-06 00:17:06,777 INFO L131 PetriNetUnfolder]: For 453/462 co-relation queries the response was YES. [2022-12-06 00:17:06,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 490 events. 296/490 cut-off events. For 453/462 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1909 event pairs, 100 based on Foata normal form. 5/449 useless extension candidates. Maximal degree in co-relation 874. Up to 263 conditions per place. [2022-12-06 00:17:06,780 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-06 00:17:06,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-06 00:17:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:17:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:17:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 00:17:06,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 00:17:06,781 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-06 00:17:06,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-06 00:17:06,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 00:17:06,783 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-06 00:17:06,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2022-12-06 00:17:06,784 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-06 00:17:06,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:06,784 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 00:17:06,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:06,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:06,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 00:17:06,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 00:17:06,792 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-06 00:17:06,792 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 00:17:06,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 101 events. 37/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2022-12-06 00:17:06,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 00:17:06,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 00:17:06,799 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:06,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:17:06,800 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-06 00:17:06,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 00:17:06,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:06,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:06,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:17:06,801 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 00:17:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-06 00:17:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:06,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952786459] [2022-12-06 00:17:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:06,942 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 00:17:06,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:06,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952786459] [2022-12-06 00:17:06,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952786459] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:06,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608865042] [2022-12-06 00:17:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:06,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:06,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:06,946 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 00:17:06,994 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 00:17:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:17:07,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:17:07,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:17:07,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608865042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:07,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:17:07,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 00:17:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509092178] [2022-12-06 00:17:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:07,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:17:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:17:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:17:07,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:17:07,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 00:17:07,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:07,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:17:07,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:07,189 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-06 00:17:07,189 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-06 00:17:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 527 events. 304/527 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 82 based on Foata normal form. 30/524 useless extension candidates. Maximal degree in co-relation 1085. Up to 374 conditions per place. [2022-12-06 00:17:07,192 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-06 00:17:07,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-06 00:17:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:17:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:17:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 00:17:07,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 00:17:07,193 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-06 00:17:07,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-06 00:17:07,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:17:07,196 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-06 00:17:07,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2022-12-06 00:17:07,196 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-06 00:17:07,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:07,196 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 00:17:07,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:07,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:07,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 00:17:07,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 00:17:07,206 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-06 00:17:07,206 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 00:17:07,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 114 events. 37/114 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 429 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-06 00:17:07,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 00:17:07,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 00:17:07,208 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:07,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:17:07,209 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-06 00:17:07,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 00:17:07,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:07,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:07,217 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 00:17:07,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:07,415 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 00:17:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-06 00:17:07,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:07,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063730118] [2022-12-06 00:17:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:17:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:07,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063730118] [2022-12-06 00:17:07,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063730118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:07,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:07,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:17:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144388098] [2022-12-06 00:17:07,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:07,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:17:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:17:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:17:07,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 00:17:07,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 00:17:07,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:07,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 00:17:07,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:07,674 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-06 00:17:07,674 INFO L131 PetriNetUnfolder]: For 799/816 co-relation queries the response was YES. [2022-12-06 00:17:07,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 631 events. 344/631 cut-off events. For 799/816 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2836 event pairs, 212 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 1467. Up to 476 conditions per place. [2022-12-06 00:17:07,678 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-06 00:17:07,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-06 00:17:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:17:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:17:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 00:17:07,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 00:17:07,680 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-06 00:17:07,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-06 00:17:07,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:17:07,689 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-06 00:17:07,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=42} [2022-12-06 00:17:07,691 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 00:17:07,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:07,691 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-06 00:17:07,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:07,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:07,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-06 00:17:07,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-06 00:17:07,703 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-06 00:17:07,703 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 00:17:07,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 37/115 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 425 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 293. Up to 33 conditions per place. [2022-12-06 00:17:07,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-06 00:17:07,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 00:17:08,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:17:08,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 857 [2022-12-06 00:17:08,548 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-06 00:17:08,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 00:17:08,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:08,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:08,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:17:08,548 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 00:17:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-06 00:17:08,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:08,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791544218] [2022-12-06 00:17:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:09,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:09,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791544218] [2022-12-06 00:17:09,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791544218] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:09,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500294699] [2022-12-06 00:17:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:09,580 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 00:17:09,607 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 00:17:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:09,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 00:17:09,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:09,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 00:17:09,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:17:09,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:17:09,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:17:09,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:17:10,004 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 00:17:10,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 10 [2022-12-06 00:17:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:10,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:17:10,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:10,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 97 [2022-12-06 00:17:10,932 INFO L321 Elim1Store]: treesize reduction 15, result has 89.4 percent of original size [2022-12-06 00:17:10,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1382 treesize of output 1293 [2022-12-06 00:17:10,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:10,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1166 treesize of output 1115 [2022-12-06 00:17:11,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:11,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 931 [2022-12-06 00:17:11,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:11,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 890 treesize of output 865 [2022-12-06 00:17:11,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:11,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 850 treesize of output 785 [2022-12-06 00:17:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:14,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500294699] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:17:14,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:17:14,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 00:17:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858109644] [2022-12-06 00:17:15,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:17:15,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:17:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:17:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=408, Unknown=6, NotChecked=0, Total=552 [2022-12-06 00:17:15,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:17:15,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:15,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:15,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:17:15,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:17,961 INFO L130 PetriNetUnfolder]: 1112/1951 cut-off events. [2022-12-06 00:17:17,961 INFO L131 PetriNetUnfolder]: For 2022/2022 co-relation queries the response was YES. [2022-12-06 00:17:17,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6618 conditions, 1951 events. 1112/1951 cut-off events. For 2022/2022 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10676 event pairs, 139 based on Foata normal form. 33/1859 useless extension candidates. Maximal degree in co-relation 6600. Up to 489 conditions per place. [2022-12-06 00:17:17,974 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 175 selfloop transitions, 86 changer transitions 56/317 dead transitions. [2022-12-06 00:17:17,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 317 transitions, 2182 flow [2022-12-06 00:17:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 00:17:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 00:17:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 247 transitions. [2022-12-06 00:17:17,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38354037267080743 [2022-12-06 00:17:17,978 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 28 states and 247 transitions. [2022-12-06 00:17:17,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 317 transitions, 2182 flow [2022-12-06 00:17:17,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 317 transitions, 2150 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 00:17:17,993 INFO L231 Difference]: Finished difference. Result has 76 places, 129 transitions, 1099 flow [2022-12-06 00:17:17,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1099, PETRI_PLACES=76, PETRI_TRANSITIONS=129} [2022-12-06 00:17:17,995 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 51 predicate places. [2022-12-06 00:17:17,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:17,995 INFO L89 Accepts]: Start accepts. Operand has 76 places, 129 transitions, 1099 flow [2022-12-06 00:17:17,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:17,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:17,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 129 transitions, 1099 flow [2022-12-06 00:17:17,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 129 transitions, 1099 flow [2022-12-06 00:17:18,051 INFO L130 PetriNetUnfolder]: 172/451 cut-off events. [2022-12-06 00:17:18,052 INFO L131 PetriNetUnfolder]: For 1436/1453 co-relation queries the response was YES. [2022-12-06 00:17:18,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 451 events. 172/451 cut-off events. For 1436/1453 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2508 event pairs, 2 based on Foata normal form. 4/411 useless extension candidates. Maximal degree in co-relation 1679. Up to 148 conditions per place. [2022-12-06 00:17:18,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 129 transitions, 1099 flow [2022-12-06 00:17:18,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 00:17:20,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:17:21,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:17:21,105 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] $Ultimate##0-->L79: Formula: (and (= v_~new~0_64 v_~v_old~0_84) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_97 256) 0)) (<= v_~v_old~0_85 v_~new~0_64)) 1 0) 0) 0 1) v_~ok~0_96) (= (+ v_~start~0_150 1) v_~start~0_149) (= (ite (and (< v_~start~0_150 v_~end~0_184) (<= 0 v_~start~0_150) (< v_~start~0_150 v_~n~0_106)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_72| (ite (= (ite (or (< v_~start~0_149 v_~end~0_184) (< v_~i~0_186 v_~N~0_155)) 1 0) 0) 0 1)) (= v_~new~0_64 (select (select |v_#memory_int_262| v_~queue~0.base_102) (+ (* v_~start~0_150 4) v_~queue~0.offset_102)))) InVars {~start~0=v_~start~0_150, ~queue~0.offset=v_~queue~0.offset_102, ~ok~0=v_~ok~0_97, ~i~0=v_~i~0_186, #memory_int=|v_#memory_int_262|, ~end~0=v_~end~0_184, ~N~0=v_~N~0_155, ~v_old~0=v_~v_old~0_85, ~queue~0.base=v_~queue~0.base_102, ~n~0=v_~n~0_106} OutVars{~start~0=v_~start~0_149, ~new~0=v_~new~0_64, ~queue~0.offset=v_~queue~0.offset_102, ~ok~0=v_~ok~0_96, ~i~0=v_~i~0_186, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_155, ~queue~0.base=v_~queue~0.base_102, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_72|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_262|, ~end~0=v_~end~0_184, ~v_old~0=v_~v_old~0_84, ~n~0=v_~n~0_106} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:17:21,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:17:21,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:17:21,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:17:21,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:17:21,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:17:31,333 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 00:17:31,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13339 [2022-12-06 00:17:31,334 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 123 transitions, 1140 flow [2022-12-06 00:17:31,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:31,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:31,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:31,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:17:31,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 00:17:31,541 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 00:17:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1802932544, now seen corresponding path program 1 times [2022-12-06 00:17:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:31,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290486444] [2022-12-06 00:17:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290486444] [2022-12-06 00:17:32,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290486444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903447614] [2022-12-06 00:17:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:32,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:32,126 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 00:17:32,129 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 00:17:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:32,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:17:32,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:32,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-06 00:17:32,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-12-06 00:17:32,270 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:17:32,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 00:17:32,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:17:32,392 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:17:32,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-12-06 00:17:32,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-06 00:17:32,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 00:17:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:32,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:17:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:32,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903447614] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:17:32,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:17:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 00:17:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330693768] [2022-12-06 00:17:32,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:17:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:17:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:17:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:17:32,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:17:32,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 123 transitions, 1140 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 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 00:17:32,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:32,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:17:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:35,542 INFO L130 PetriNetUnfolder]: 2078/3657 cut-off events. [2022-12-06 00:17:35,542 INFO L131 PetriNetUnfolder]: For 12819/12819 co-relation queries the response was YES. [2022-12-06 00:17:35,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16131 conditions, 3657 events. 2078/3657 cut-off events. For 12819/12819 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22602 event pairs, 253 based on Foata normal form. 52/3487 useless extension candidates. Maximal degree in co-relation 16082. Up to 1172 conditions per place. [2022-12-06 00:17:35,572 INFO L137 encePairwiseOnDemand]: 6/36 looper letters, 273 selfloop transitions, 197 changer transitions 69/539 dead transitions. [2022-12-06 00:17:35,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 539 transitions, 5281 flow [2022-12-06 00:17:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 00:17:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 00:17:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 319 transitions. [2022-12-06 00:17:35,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28584229390681004 [2022-12-06 00:17:35,575 INFO L175 Difference]: Start difference. First operand has 66 places, 123 transitions, 1140 flow. Second operand 31 states and 319 transitions. [2022-12-06 00:17:35,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 539 transitions, 5281 flow [2022-12-06 00:17:35,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 539 transitions, 4514 flow, removed 257 selfloop flow, removed 11 redundant places. [2022-12-06 00:17:35,659 INFO L231 Difference]: Finished difference. Result has 110 places, 279 transitions, 2938 flow [2022-12-06 00:17:35,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2938, PETRI_PLACES=110, PETRI_TRANSITIONS=279} [2022-12-06 00:17:35,660 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 85 predicate places. [2022-12-06 00:17:35,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:35,660 INFO L89 Accepts]: Start accepts. Operand has 110 places, 279 transitions, 2938 flow [2022-12-06 00:17:35,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:35,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:35,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 279 transitions, 2938 flow [2022-12-06 00:17:35,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 279 transitions, 2938 flow [2022-12-06 00:17:35,785 INFO L130 PetriNetUnfolder]: 427/1100 cut-off events. [2022-12-06 00:17:35,785 INFO L131 PetriNetUnfolder]: For 5961/5993 co-relation queries the response was YES. [2022-12-06 00:17:35,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5394 conditions, 1100 events. 427/1100 cut-off events. For 5961/5993 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7841 event pairs, 19 based on Foata normal form. 6/1094 useless extension candidates. Maximal degree in co-relation 5328. Up to 405 conditions per place. [2022-12-06 00:17:35,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 279 transitions, 2938 flow [2022-12-06 00:17:35,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 1014 [2022-12-06 00:17:35,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:35,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [698] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= (ite (or (< v_~start~0_157 v_~end~0_188) (< v_~i~0_193 v_~N~0_159)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (+ v_~i~0_193 1) v_~i~0_192) (= v_~new~0_68 v_~v_old~0_92) (= (ite (= (ite (and (<= v_~v_old~0_93 v_~new~0_68) (not (= (mod v_~ok~0_105 256) 0))) 1 0) 0) 0 1) v_~ok~0_104) (= v_~new~0_68 (select (select |v_#memory_int_266| v_~queue~0.base_106) (+ v_~queue~0.offset_106 (* v_~start~0_158 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= (ite (and (< v_~start~0_158 v_~end~0_188) (< v_~start~0_158 v_~n~0_110) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_106, ~ok~0=v_~ok~0_105, ~i~0=v_~i~0_193, #memory_int=|v_#memory_int_266|, ~end~0=v_~end~0_188, ~N~0=v_~N~0_159, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_106, ~n~0=v_~n~0_110} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_68, ~queue~0.offset=v_~queue~0.offset_106, ~ok~0=v_~ok~0_104, ~i~0=v_~i~0_192, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~N~0=v_~N~0_159, ~queue~0.base=v_~queue~0.base_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_35|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_266|, ~end~0=v_~end~0_188, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_110} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:36,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [699] L79-->L59: Formula: (and (= (ite (and (<= 0 v_~start~0_162) (< v_~start~0_162 v_~n~0_112) (< v_~start~0_162 v_~end~0_190)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= v_~new~0_70 v_~v_old~0_96) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_83| 256) 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_82| (ite (= (ite (or (< v_~i~0_197 v_~N~0_161) (< v_~start~0_161 v_~end~0_190)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= (+ v_~start~0_162 1) v_~start~0_161) (= (ite (= (ite (and (not (= (mod v_~ok~0_109 256) 0)) (<= v_~v_old~0_97 v_~new~0_70)) 1 0) 0) 0 1) v_~ok~0_108) (= v_~i~0_196 (+ v_~i~0_197 1)) (= v_~new~0_70 (select (select |v_#memory_int_268| v_~queue~0.base_108) (+ (* v_~start~0_162 4) v_~queue~0.offset_108))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~start~0=v_~start~0_162, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_109, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_83|, ~i~0=v_~i~0_197, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_190, ~N~0=v_~N~0_161, ~v_old~0=v_~v_old~0_97, ~queue~0.base=v_~queue~0.base_108, ~n~0=v_~n~0_112} OutVars{~start~0=v_~start~0_161, ~new~0=v_~new~0_70, ~queue~0.offset=v_~queue~0.offset_108, ~ok~0=v_~ok~0_108, ~i~0=v_~i~0_196, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~N~0=v_~N~0_161, ~queue~0.base=v_~queue~0.base_108, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_49|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_82|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_37|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_190, ~v_old~0=v_~v_old~0_96, ~n~0=v_~n~0_112} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:36,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [695] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_70| (ite (= (ite (or (< v_~i~0_183 v_~N~0_153) (< v_~start~0_147 v_~end~0_182)) 1 0) 0) 0 1)) (= (+ v_~i~0_183 1) v_~i~0_182)) InVars {~start~0=v_~start~0_147, ~i~0=v_~i~0_183, ~end~0=v_~end~0_182, ~N~0=v_~N~0_153} OutVars{~start~0=v_~start~0_147, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_70|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_182, ~end~0=v_~end~0_182, ~N~0=v_~N~0_153} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:17:36,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:17:36,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:36,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [697] L79-->L59: Formula: (and (= v_~new~0_66 v_~v_old~0_88) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= v_~start~0_153 (+ v_~start~0_154 1)) (= (ite (= (ite (or (< v_~i~0_189 v_~N~0_157) (< v_~start~0_153 v_~end~0_186)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= (ite (= (ite (and (<= v_~v_old~0_89 v_~new~0_66) (not (= (mod v_~ok~0_101 256) 0))) 1 0) 0) 0 1) v_~ok~0_100) (= v_~new~0_66 (select (select |v_#memory_int_264| v_~queue~0.base_104) (+ (* v_~start~0_154 4) v_~queue~0.offset_104))) (= (+ v_~i~0_189 1) v_~i~0_188) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_77| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23| (ite (and (< v_~start~0_154 v_~n~0_108) (<= 0 v_~start~0_154) (< v_~start~0_154 v_~end~0_186)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~start~0=v_~start~0_154, ~queue~0.offset=v_~queue~0.offset_104, ~ok~0=v_~ok~0_101, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_77|, ~i~0=v_~i~0_189, #memory_int=|v_#memory_int_264|, ~end~0=v_~end~0_186, ~N~0=v_~N~0_157, ~v_old~0=v_~v_old~0_89, ~queue~0.base=v_~queue~0.base_104, ~n~0=v_~n~0_108} OutVars{~start~0=v_~start~0_153, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_104, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_188, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, ~N~0=v_~N~0_157, ~queue~0.base=v_~queue~0.base_104, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_45|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_23|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_76|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_33|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_264|, ~end~0=v_~end~0_186, ~v_old~0=v_~v_old~0_88, ~n~0=v_~n~0_108} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:36,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:17:36,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 00:17:36,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:36,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:17:36,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 00:17:36,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 00:17:36,915 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:17:36,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1256 [2022-12-06 00:17:36,916 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 273 transitions, 2989 flow [2022-12-06 00:17:36,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 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 00:17:36,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:36,916 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:36,936 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 00:17:37,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:37,123 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 00:17:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1330626402, now seen corresponding path program 1 times [2022-12-06 00:17:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937327233] [2022-12-06 00:17:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:37,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937327233] [2022-12-06 00:17:37,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937327233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:37,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468276333] [2022-12-06 00:17:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:37,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:37,333 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 00:17:37,335 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 00:17:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:17:37,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:37,432 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 00:17:37,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:17:37,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468276333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:37,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:17:37,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-06 00:17:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504623281] [2022-12-06 00:17:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:37,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:17:37,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:17:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:17:37,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:17:37,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 273 transitions, 2989 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 00:17:37,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:37,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:17:37,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:37,964 INFO L130 PetriNetUnfolder]: 1944/3527 cut-off events. [2022-12-06 00:17:37,964 INFO L131 PetriNetUnfolder]: For 23087/23087 co-relation queries the response was YES. [2022-12-06 00:17:37,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18925 conditions, 3527 events. 1944/3527 cut-off events. For 23087/23087 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21747 event pairs, 393 based on Foata normal form. 240/3764 useless extension candidates. Maximal degree in co-relation 18835. Up to 1440 conditions per place. [2022-12-06 00:17:38,002 INFO L137 encePairwiseOnDemand]: 38/59 looper letters, 176 selfloop transitions, 133 changer transitions 0/309 dead transitions. [2022-12-06 00:17:38,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 309 transitions, 3906 flow [2022-12-06 00:17:38,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:17:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:17:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 00:17:38,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3771186440677966 [2022-12-06 00:17:38,004 INFO L175 Difference]: Start difference. First operand has 101 places, 273 transitions, 2989 flow. Second operand 4 states and 89 transitions. [2022-12-06 00:17:38,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 309 transitions, 3906 flow [2022-12-06 00:17:38,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 309 transitions, 3518 flow, removed 148 selfloop flow, removed 11 redundant places. [2022-12-06 00:17:38,102 INFO L231 Difference]: Finished difference. Result has 94 places, 267 transitions, 3186 flow [2022-12-06 00:17:38,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3186, PETRI_PLACES=94, PETRI_TRANSITIONS=267} [2022-12-06 00:17:38,103 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 69 predicate places. [2022-12-06 00:17:38,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:38,103 INFO L89 Accepts]: Start accepts. Operand has 94 places, 267 transitions, 3186 flow [2022-12-06 00:17:38,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:38,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:38,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 267 transitions, 3186 flow [2022-12-06 00:17:38,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 267 transitions, 3186 flow [2022-12-06 00:17:38,224 INFO L130 PetriNetUnfolder]: 418/1213 cut-off events. [2022-12-06 00:17:38,225 INFO L131 PetriNetUnfolder]: For 7198/7258 co-relation queries the response was YES. [2022-12-06 00:17:38,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5996 conditions, 1213 events. 418/1213 cut-off events. For 7198/7258 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9047 event pairs, 22 based on Foata normal form. 13/1214 useless extension candidates. Maximal degree in co-relation 5882. Up to 391 conditions per place. [2022-12-06 00:17:38,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 267 transitions, 3186 flow [2022-12-06 00:17:38,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 992 [2022-12-06 00:17:38,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:38,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 00:17:38,237 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 267 transitions, 3186 flow [2022-12-06 00:17:38,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 00:17:38,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:38,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:38,244 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 00:17:38,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:38,443 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 00:17:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1505712246, now seen corresponding path program 1 times [2022-12-06 00:17:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:38,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412886557] [2022-12-06 00:17:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:38,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:38,520 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 00:17:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:38,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412886557] [2022-12-06 00:17:38,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412886557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:38,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528117529] [2022-12-06 00:17:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:38,522 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 00:17:38,525 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 00:17:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:38,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:17:38,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:38,689 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 00:17:38,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:17:38,707 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 00:17:38,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528117529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:17:38,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:17:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-06 00:17:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125328287] [2022-12-06 00:17:38,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:17:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:17:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:17:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:17:38,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:17:38,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 267 transitions, 3186 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 00:17:38,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:38,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:17:38,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:39,723 INFO L130 PetriNetUnfolder]: 2559/4632 cut-off events. [2022-12-06 00:17:39,723 INFO L131 PetriNetUnfolder]: For 29356/29356 co-relation queries the response was YES. [2022-12-06 00:17:39,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25485 conditions, 4632 events. 2559/4632 cut-off events. For 29356/29356 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30631 event pairs, 675 based on Foata normal form. 82/4707 useless extension candidates. Maximal degree in co-relation 25092. Up to 1913 conditions per place. [2022-12-06 00:17:39,758 INFO L137 encePairwiseOnDemand]: 28/53 looper letters, 329 selfloop transitions, 114 changer transitions 0/443 dead transitions. [2022-12-06 00:17:39,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 443 transitions, 6069 flow [2022-12-06 00:17:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:17:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:17:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-06 00:17:39,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41509433962264153 [2022-12-06 00:17:39,759 INFO L175 Difference]: Start difference. First operand has 94 places, 267 transitions, 3186 flow. Second operand 5 states and 110 transitions. [2022-12-06 00:17:39,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 443 transitions, 6069 flow [2022-12-06 00:17:39,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 443 transitions, 5999 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-06 00:17:39,881 INFO L231 Difference]: Finished difference. Result has 99 places, 314 transitions, 4022 flow [2022-12-06 00:17:39,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4022, PETRI_PLACES=99, PETRI_TRANSITIONS=314} [2022-12-06 00:17:39,883 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 74 predicate places. [2022-12-06 00:17:39,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:39,883 INFO L89 Accepts]: Start accepts. Operand has 99 places, 314 transitions, 4022 flow [2022-12-06 00:17:39,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:39,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:39,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 314 transitions, 4022 flow [2022-12-06 00:17:39,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 314 transitions, 4022 flow [2022-12-06 00:17:40,061 INFO L130 PetriNetUnfolder]: 560/1589 cut-off events. [2022-12-06 00:17:40,061 INFO L131 PetriNetUnfolder]: For 11169/11269 co-relation queries the response was YES. [2022-12-06 00:17:40,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8854 conditions, 1589 events. 560/1589 cut-off events. For 11169/11269 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12618 event pairs, 36 based on Foata normal form. 16/1586 useless extension candidates. Maximal degree in co-relation 8675. Up to 530 conditions per place. [2022-12-06 00:17:40,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 314 transitions, 4022 flow [2022-12-06 00:17:40,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 1136 [2022-12-06 00:17:40,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:17:40,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 00:17:40,135 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 314 transitions, 4031 flow [2022-12-06 00:17:40,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 00:17:40,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:40,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:40,141 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 00:17:40,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 00:17:40,341 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 00:17:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1276393230, now seen corresponding path program 1 times [2022-12-06 00:17:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:40,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30155517] [2022-12-06 00:17:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:41,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30155517] [2022-12-06 00:17:41,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30155517] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:41,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882902136] [2022-12-06 00:17:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:41,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:41,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:41,599 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 00:17:41,601 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 00:17:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:41,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 00:17:41,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:41,879 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 00:17:41,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-12-06 00:17:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:41,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:17:46,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:46,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 126 [2022-12-06 00:17:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:17:46,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882902136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:17:46,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:17:46,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 21 [2022-12-06 00:17:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469809212] [2022-12-06 00:17:46,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:17:46,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:17:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:17:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=382, Unknown=1, NotChecked=0, Total=506 [2022-12-06 00:17:46,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:17:46,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 314 transitions, 4031 flow. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:46,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:46,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:17:46,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:48,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:17:50,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:17:53,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:17:55,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:17:57,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:17:59,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:18:01,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:18:03,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:18:06,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:18:08,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:18:08,604 INFO L130 PetriNetUnfolder]: 3823/6856 cut-off events. [2022-12-06 00:18:08,604 INFO L131 PetriNetUnfolder]: For 46837/46837 co-relation queries the response was YES. [2022-12-06 00:18:08,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39725 conditions, 6856 events. 3823/6856 cut-off events. For 46837/46837 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 47519 event pairs, 299 based on Foata normal form. 5/6855 useless extension candidates. Maximal degree in co-relation 37461. Up to 2185 conditions per place. [2022-12-06 00:18:08,648 INFO L137 encePairwiseOnDemand]: 15/54 looper letters, 330 selfloop transitions, 280 changer transitions 29/639 dead transitions. [2022-12-06 00:18:08,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 639 transitions, 8727 flow [2022-12-06 00:18:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:18:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:18:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 199 transitions. [2022-12-06 00:18:08,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18425925925925926 [2022-12-06 00:18:08,651 INFO L175 Difference]: Start difference. First operand has 99 places, 314 transitions, 4031 flow. Second operand 20 states and 199 transitions. [2022-12-06 00:18:08,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 639 transitions, 8727 flow [2022-12-06 00:18:08,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 639 transitions, 8613 flow, removed 57 selfloop flow, removed 0 redundant places. [2022-12-06 00:18:08,819 INFO L231 Difference]: Finished difference. Result has 125 places, 433 transitions, 6351 flow [2022-12-06 00:18:08,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3981, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6351, PETRI_PLACES=125, PETRI_TRANSITIONS=433} [2022-12-06 00:18:08,819 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2022-12-06 00:18:08,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:08,819 INFO L89 Accepts]: Start accepts. Operand has 125 places, 433 transitions, 6351 flow [2022-12-06 00:18:08,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:08,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:08,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 433 transitions, 6351 flow [2022-12-06 00:18:08,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 433 transitions, 6351 flow [2022-12-06 00:18:09,079 INFO L130 PetriNetUnfolder]: 829/2298 cut-off events. [2022-12-06 00:18:09,079 INFO L131 PetriNetUnfolder]: For 22171/22288 co-relation queries the response was YES. [2022-12-06 00:18:09,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14063 conditions, 2298 events. 829/2298 cut-off events. For 22171/22288 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19510 event pairs, 41 based on Foata normal form. 13/2287 useless extension candidates. Maximal degree in co-relation 14012. Up to 765 conditions per place. [2022-12-06 00:18:09,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 433 transitions, 6351 flow [2022-12-06 00:18:09,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 1640 [2022-12-06 00:18:15,336 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:18:15,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6518 [2022-12-06 00:18:15,337 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 433 transitions, 6385 flow [2022-12-06 00:18:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:15,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:15,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:15,345 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 00:18:15,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:15,545 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 00:18:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1749153037, now seen corresponding path program 1 times [2022-12-06 00:18:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:15,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942810074] [2022-12-06 00:18:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:17,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942810074] [2022-12-06 00:18:17,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942810074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:17,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819060792] [2022-12-06 00:18:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:17,062 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 00:18:17,063 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 00:18:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:17,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 00:18:17,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:17,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:18:17,301 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:18:17,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 00:18:17,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 00:18:17,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 00:18:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:17,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:17,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:17,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 00:18:17,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-06 00:18:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:17,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819060792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:18:17,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:18:17,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 00:18:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886992842] [2022-12-06 00:18:17,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:18:17,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:18:17,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:17,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:18:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-12-06 00:18:17,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 00:18:17,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 433 transitions, 6385 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 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 00:18:17,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:17,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 00:18:17,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:20,573 INFO L130 PetriNetUnfolder]: 5632/9942 cut-off events. [2022-12-06 00:18:20,573 INFO L131 PetriNetUnfolder]: For 96322/96322 co-relation queries the response was YES. [2022-12-06 00:18:20,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63392 conditions, 9942 events. 5632/9942 cut-off events. For 96322/96322 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 72385 event pairs, 495 based on Foata normal form. 9/9946 useless extension candidates. Maximal degree in co-relation 63335. Up to 3609 conditions per place. [2022-12-06 00:18:20,728 INFO L137 encePairwiseOnDemand]: 18/57 looper letters, 412 selfloop transitions, 373 changer transitions 29/814 dead transitions. [2022-12-06 00:18:20,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 814 transitions, 12803 flow [2022-12-06 00:18:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:18:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:18:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 195 transitions. [2022-12-06 00:18:20,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2022-12-06 00:18:20,731 INFO L175 Difference]: Start difference. First operand has 124 places, 433 transitions, 6385 flow. Second operand 15 states and 195 transitions. [2022-12-06 00:18:20,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 814 transitions, 12803 flow [2022-12-06 00:18:21,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 814 transitions, 12686 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-06 00:18:21,150 INFO L231 Difference]: Finished difference. Result has 147 places, 582 transitions, 10078 flow [2022-12-06 00:18:21,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=6193, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10078, PETRI_PLACES=147, PETRI_TRANSITIONS=582} [2022-12-06 00:18:21,151 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 122 predicate places. [2022-12-06 00:18:21,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:21,151 INFO L89 Accepts]: Start accepts. Operand has 147 places, 582 transitions, 10078 flow [2022-12-06 00:18:21,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:21,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:21,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 582 transitions, 10078 flow [2022-12-06 00:18:21,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 582 transitions, 10078 flow [2022-12-06 00:18:21,634 INFO L130 PetriNetUnfolder]: 1267/3378 cut-off events. [2022-12-06 00:18:21,634 INFO L131 PetriNetUnfolder]: For 46745/46898 co-relation queries the response was YES. [2022-12-06 00:18:21,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23672 conditions, 3378 events. 1267/3378 cut-off events. For 46745/46898 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 30261 event pairs, 55 based on Foata normal form. 17/3370 useless extension candidates. Maximal degree in co-relation 22386. Up to 1166 conditions per place. [2022-12-06 00:18:21,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 582 transitions, 10078 flow [2022-12-06 00:18:21,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 2322 [2022-12-06 00:18:21,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:18:22,578 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:18:22,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1428 [2022-12-06 00:18:22,579 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 582 transitions, 10087 flow [2022-12-06 00:18:22,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 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 00:18:22,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:22,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:22,601 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 00:18:22,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:22,785 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 00:18:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash 833817497, now seen corresponding path program 1 times [2022-12-06 00:18:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:22,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898430718] [2022-12-06 00:18:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898430718] [2022-12-06 00:18:23,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898430718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667234154] [2022-12-06 00:18:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:23,914 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:18:23,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:18:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:24,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 00:18:24,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:24,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 00:18:24,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:18:24,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:18:24,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:18:24,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:18:24,226 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 00:18:24,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-12-06 00:18:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:24,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:28,467 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (* c_~end~0 4))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_521 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_521))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset))))))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_521))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select (select .cse4 c_~A~0.base) .cse1) (select .cse3 (+ .cse2 ~queue~0.offset)))))))))) is different from false [2022-12-06 00:18:28,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:28,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 97 [2022-12-06 00:18:28,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:28,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1359 treesize of output 1319 [2022-12-06 00:18:28,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:28,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1166 treesize of output 1113 [2022-12-06 00:18:28,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:28,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1034 treesize of output 891 [2022-12-06 00:18:28,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:28,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 850 treesize of output 785 [2022-12-06 00:19:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 00:19:03,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667234154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:03,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:03,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 00:19:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74378757] [2022-12-06 00:19:03,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:19:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:19:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=260, Unknown=2, NotChecked=34, Total=380 [2022-12-06 00:19:03,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:19:03,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 582 transitions, 10087 flow. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 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 00:19:03,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:03,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:19:03,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:06,595 INFO L130 PetriNetUnfolder]: 7286/12780 cut-off events. [2022-12-06 00:19:06,595 INFO L131 PetriNetUnfolder]: For 174733/174733 co-relation queries the response was YES. [2022-12-06 00:19:06,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92030 conditions, 12780 events. 7286/12780 cut-off events. For 174733/174733 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 96687 event pairs, 632 based on Foata normal form. 26/12802 useless extension candidates. Maximal degree in co-relation 84803. Up to 5769 conditions per place. [2022-12-06 00:19:06,731 INFO L137 encePairwiseOnDemand]: 25/59 looper letters, 494 selfloop transitions, 441 changer transitions 24/959 dead transitions. [2022-12-06 00:19:06,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 959 transitions, 17374 flow [2022-12-06 00:19:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:19:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:19:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 205 transitions. [2022-12-06 00:19:06,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23163841807909605 [2022-12-06 00:19:06,734 INFO L175 Difference]: Start difference. First operand has 146 places, 582 transitions, 10087 flow. Second operand 15 states and 205 transitions. [2022-12-06 00:19:06,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 959 transitions, 17374 flow [2022-12-06 00:19:08,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 959 transitions, 17081 flow, removed 140 selfloop flow, removed 2 redundant places. [2022-12-06 00:19:08,018 INFO L231 Difference]: Finished difference. Result has 165 places, 723 transitions, 13989 flow [2022-12-06 00:19:08,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=9178, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13989, PETRI_PLACES=165, PETRI_TRANSITIONS=723} [2022-12-06 00:19:08,019 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 140 predicate places. [2022-12-06 00:19:08,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:08,019 INFO L89 Accepts]: Start accepts. Operand has 165 places, 723 transitions, 13989 flow [2022-12-06 00:19:08,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:08,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:08,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 723 transitions, 13989 flow [2022-12-06 00:19:08,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 723 transitions, 13989 flow [2022-12-06 00:19:08,714 INFO L130 PetriNetUnfolder]: 1660/4406 cut-off events. [2022-12-06 00:19:08,714 INFO L131 PetriNetUnfolder]: For 71565/71701 co-relation queries the response was YES. [2022-12-06 00:19:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32547 conditions, 4406 events. 1660/4406 cut-off events. For 71565/71701 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 41665 event pairs, 74 based on Foata normal form. 9/4390 useless extension candidates. Maximal degree in co-relation 32478. Up to 1519 conditions per place. [2022-12-06 00:19:08,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 723 transitions, 13989 flow [2022-12-06 00:19:08,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 3090 [2022-12-06 00:19:08,780 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:08,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 761 [2022-12-06 00:19:08,780 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 723 transitions, 13989 flow [2022-12-06 00:19:08,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 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 00:19:08,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:08,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:08,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 00:19:08,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 00:19:08,986 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1941938235, now seen corresponding path program 2 times [2022-12-06 00:19:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:08,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054628738] [2022-12-06 00:19:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:19:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:09,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054628738] [2022-12-06 00:19:09,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054628738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:09,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212551540] [2022-12-06 00:19:09,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:19:09,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:09,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:09,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:19:09,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:19:09,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:19:09,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 00:19:09,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:09,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 00:19:09,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:09,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:19:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:09,812 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 00:19:09,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-12-06 00:19:09,898 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 00:19:09,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-12-06 00:19:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:19:09,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:10,016 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_580 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) is different from false [2022-12-06 00:19:10,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:10,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 85 [2022-12-06 00:19:10,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:10,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 355 [2022-12-06 00:19:10,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:10,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 241 [2022-12-06 00:19:10,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 150 [2022-12-06 00:19:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:19:14,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212551540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:14,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:14,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 00:19:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062311630] [2022-12-06 00:19:14,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:14,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:19:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:19:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=286, Unknown=1, NotChecked=36, Total=420 [2022-12-06 00:19:14,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 00:19:14,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 723 transitions, 13989 flow. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 00:19:14,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:14,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 00:19:14,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:18,680 INFO L130 PetriNetUnfolder]: 8063/14071 cut-off events. [2022-12-06 00:19:18,680 INFO L131 PetriNetUnfolder]: For 229214/229214 co-relation queries the response was YES. [2022-12-06 00:19:18,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107478 conditions, 14071 events. 8063/14071 cut-off events. For 229214/229214 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 107259 event pairs, 652 based on Foata normal form. 10/14077 useless extension candidates. Maximal degree in co-relation 107403. Up to 4915 conditions per place. [2022-12-06 00:19:18,898 INFO L137 encePairwiseOnDemand]: 15/58 looper letters, 474 selfloop transitions, 632 changer transitions 25/1131 dead transitions. [2022-12-06 00:19:18,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1131 transitions, 21668 flow [2022-12-06 00:19:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 00:19:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 00:19:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 279 transitions. [2022-12-06 00:19:18,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19241379310344828 [2022-12-06 00:19:18,917 INFO L175 Difference]: Start difference. First operand has 163 places, 723 transitions, 13989 flow. Second operand 25 states and 279 transitions. [2022-12-06 00:19:18,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1131 transitions, 21668 flow [2022-12-06 00:19:20,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1131 transitions, 21534 flow, removed 67 selfloop flow, removed 2 redundant places. [2022-12-06 00:19:20,095 INFO L231 Difference]: Finished difference. Result has 200 places, 837 transitions, 18219 flow [2022-12-06 00:19:20,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=13705, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=511, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=18219, PETRI_PLACES=200, PETRI_TRANSITIONS=837} [2022-12-06 00:19:20,096 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2022-12-06 00:19:20,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:20,096 INFO L89 Accepts]: Start accepts. Operand has 200 places, 837 transitions, 18219 flow [2022-12-06 00:19:20,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:20,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:20,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 837 transitions, 18219 flow [2022-12-06 00:19:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 837 transitions, 18219 flow [2022-12-06 00:19:21,163 INFO L130 PetriNetUnfolder]: 2272/5764 cut-off events. [2022-12-06 00:19:21,163 INFO L131 PetriNetUnfolder]: For 118074/118241 co-relation queries the response was YES. [2022-12-06 00:19:21,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46495 conditions, 5764 events. 2272/5764 cut-off events. For 118074/118241 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 55282 event pairs, 134 based on Foata normal form. 20/5754 useless extension candidates. Maximal degree in co-relation 46412. Up to 2053 conditions per place. [2022-12-06 00:19:21,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 837 transitions, 18219 flow [2022-12-06 00:19:21,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 3508 [2022-12-06 00:19:21,267 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:21,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1173 [2022-12-06 00:19:21,269 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 837 transitions, 18219 flow [2022-12-06 00:19:21,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 00:19:21,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:21,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:21,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 00:19:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 00:19:21,475 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -890640307, now seen corresponding path program 1 times [2022-12-06 00:19:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:21,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912391352] [2022-12-06 00:19:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:21,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:21,599 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 00:19:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:21,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912391352] [2022-12-06 00:19:21,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912391352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:21,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286113679] [2022-12-06 00:19:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:21,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:21,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:21,604 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:21,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:19:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:21,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:19:21,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:21,740 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 00:19:21,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:21,766 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 00:19:21,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286113679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:21,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 00:19:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801845950] [2022-12-06 00:19:21,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:21,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:19:21,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:21,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:19:21,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:19:21,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:19:21,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 837 transitions, 18219 flow. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 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 00:19:21,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:21,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:19:21,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:25,884 INFO L130 PetriNetUnfolder]: 8534/14874 cut-off events. [2022-12-06 00:19:25,885 INFO L131 PetriNetUnfolder]: For 310611/310611 co-relation queries the response was YES. [2022-12-06 00:19:25,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125390 conditions, 14874 events. 8534/14874 cut-off events. For 310611/310611 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 114233 event pairs, 898 based on Foata normal form. 66/14936 useless extension candidates. Maximal degree in co-relation 125301. Up to 5518 conditions per place. [2022-12-06 00:19:26,160 INFO L137 encePairwiseOnDemand]: 26/56 looper letters, 998 selfloop transitions, 203 changer transitions 0/1201 dead transitions. [2022-12-06 00:19:26,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1201 transitions, 28444 flow [2022-12-06 00:19:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:19:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:19:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-06 00:19:26,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29591836734693877 [2022-12-06 00:19:26,174 INFO L175 Difference]: Start difference. First operand has 199 places, 837 transitions, 18219 flow. Second operand 7 states and 116 transitions. [2022-12-06 00:19:26,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1201 transitions, 28444 flow [2022-12-06 00:19:28,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1201 transitions, 27449 flow, removed 88 selfloop flow, removed 8 redundant places. [2022-12-06 00:19:28,445 INFO L231 Difference]: Finished difference. Result has 199 places, 864 transitions, 18608 flow [2022-12-06 00:19:28,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=17531, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18608, PETRI_PLACES=199, PETRI_TRANSITIONS=864} [2022-12-06 00:19:28,446 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 174 predicate places. [2022-12-06 00:19:28,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:28,447 INFO L89 Accepts]: Start accepts. Operand has 199 places, 864 transitions, 18608 flow [2022-12-06 00:19:28,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:28,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:28,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 864 transitions, 18608 flow [2022-12-06 00:19:28,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 864 transitions, 18608 flow [2022-12-06 00:19:29,669 INFO L130 PetriNetUnfolder]: 2429/6148 cut-off events. [2022-12-06 00:19:29,669 INFO L131 PetriNetUnfolder]: For 135374/135610 co-relation queries the response was YES. [2022-12-06 00:19:29,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51534 conditions, 6148 events. 2429/6148 cut-off events. For 135374/135610 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 59753 event pairs, 167 based on Foata normal form. 20/6137 useless extension candidates. Maximal degree in co-relation 51026. Up to 2193 conditions per place. [2022-12-06 00:19:29,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 864 transitions, 18608 flow [2022-12-06 00:19:29,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 3596 [2022-12-06 00:19:35,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:19:35,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7185 [2022-12-06 00:19:35,631 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 864 transitions, 18642 flow [2022-12-06 00:19:35,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 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 00:19:35,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:35,631 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:35,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:19:35,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 00:19:35,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:35,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1509109138, now seen corresponding path program 1 times [2022-12-06 00:19:35,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:35,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368938126] [2022-12-06 00:19:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:19:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368938126] [2022-12-06 00:19:35,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368938126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:35,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476400170] [2022-12-06 00:19:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:35,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:35,910 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:35,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:19:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:36,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:19:36,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:19:36,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:19:36,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476400170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:36,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:19:36,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 00:19:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594758790] [2022-12-06 00:19:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:36,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:19:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:19:36,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:19:36,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 00:19:36,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 864 transitions, 18642 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 00:19:36,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:36,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 00:19:36,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:39,927 INFO L130 PetriNetUnfolder]: 7311/13001 cut-off events. [2022-12-06 00:19:39,928 INFO L131 PetriNetUnfolder]: For 286655/286655 co-relation queries the response was YES. [2022-12-06 00:19:40,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110268 conditions, 13001 events. 7311/13001 cut-off events. For 286655/286655 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 100350 event pairs, 3142 based on Foata normal form. 234/13231 useless extension candidates. Maximal degree in co-relation 108920. Up to 11976 conditions per place. [2022-12-06 00:19:40,055 INFO L137 encePairwiseOnDemand]: 46/58 looper letters, 678 selfloop transitions, 0 changer transitions 124/802 dead transitions. [2022-12-06 00:19:40,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 802 transitions, 18547 flow [2022-12-06 00:19:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:19:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:19:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 00:19:40,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-06 00:19:40,056 INFO L175 Difference]: Start difference. First operand has 199 places, 864 transitions, 18642 flow. Second operand 4 states and 86 transitions. [2022-12-06 00:19:40,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 802 transitions, 18547 flow [2022-12-06 00:19:41,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 802 transitions, 18343 flow, removed 67 selfloop flow, removed 2 redundant places. [2022-12-06 00:19:41,742 INFO L231 Difference]: Finished difference. Result has 202 places, 678 transitions, 14009 flow [2022-12-06 00:19:41,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=16154, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=14009, PETRI_PLACES=202, PETRI_TRANSITIONS=678} [2022-12-06 00:19:41,743 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 177 predicate places. [2022-12-06 00:19:41,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:41,744 INFO L89 Accepts]: Start accepts. Operand has 202 places, 678 transitions, 14009 flow [2022-12-06 00:19:41,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:41,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:41,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 678 transitions, 14009 flow [2022-12-06 00:19:41,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 678 transitions, 14009 flow [2022-12-06 00:19:42,750 INFO L130 PetriNetUnfolder]: 1939/4936 cut-off events. [2022-12-06 00:19:42,750 INFO L131 PetriNetUnfolder]: For 102161/102339 co-relation queries the response was YES. [2022-12-06 00:19:42,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40312 conditions, 4936 events. 1939/4936 cut-off events. For 102161/102339 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 46420 event pairs, 141 based on Foata normal form. 16/4926 useless extension candidates. Maximal degree in co-relation 39810. Up to 1781 conditions per place. [2022-12-06 00:19:42,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 678 transitions, 14009 flow [2022-12-06 00:19:42,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 2726 [2022-12-06 00:19:42,843 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:42,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1102 [2022-12-06 00:19:42,846 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 678 transitions, 14009 flow [2022-12-06 00:19:42,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 00:19:42,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:42,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:42,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:19:43,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 00:19:43,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1954068228, now seen corresponding path program 1 times [2022-12-06 00:19:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:43,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889026783] [2022-12-06 00:19:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:19:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889026783] [2022-12-06 00:19:44,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889026783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953077412] [2022-12-06 00:19:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:44,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:44,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:44,778 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:44,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:19:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:44,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 00:19:44,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:44,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 00:19:44,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 00:19:45,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 10 [2022-12-06 00:19:45,196 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 00:19:45,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:45,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:45,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 272 [2022-12-06 00:19:45,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:45,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-06 00:19:45,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:45,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2022-12-06 00:19:46,274 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 00:19:46,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953077412] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:46,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:46,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 00:19:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418018898] [2022-12-06 00:19:46,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:46,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:19:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:19:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=397, Unknown=1, NotChecked=0, Total=506 [2022-12-06 00:19:46,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:19:46,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 678 transitions, 14009 flow. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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 00:19:46,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:46,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:19:46,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:50,662 INFO L130 PetriNetUnfolder]: 7831/13693 cut-off events. [2022-12-06 00:19:50,662 INFO L131 PetriNetUnfolder]: For 280768/280768 co-relation queries the response was YES. [2022-12-06 00:19:50,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113695 conditions, 13693 events. 7831/13693 cut-off events. For 280768/280768 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 104173 event pairs, 927 based on Foata normal form. 6/13695 useless extension candidates. Maximal degree in co-relation 112195. Up to 5755 conditions per place. [2022-12-06 00:19:50,829 INFO L137 encePairwiseOnDemand]: 19/54 looper letters, 445 selfloop transitions, 509 changer transitions 24/978 dead transitions. [2022-12-06 00:19:50,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 978 transitions, 20642 flow [2022-12-06 00:19:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:19:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:19:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 178 transitions. [2022-12-06 00:19:50,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19389978213507625 [2022-12-06 00:19:50,830 INFO L175 Difference]: Start difference. First operand has 191 places, 678 transitions, 14009 flow. Second operand 17 states and 178 transitions. [2022-12-06 00:19:50,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 978 transitions, 20642 flow [2022-12-06 00:19:52,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 978 transitions, 20444 flow, removed 97 selfloop flow, removed 5 redundant places. [2022-12-06 00:19:52,906 INFO L231 Difference]: Finished difference. Result has 210 places, 768 transitions, 17623 flow [2022-12-06 00:19:52,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=13903, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=425, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=17623, PETRI_PLACES=210, PETRI_TRANSITIONS=768} [2022-12-06 00:19:52,907 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 185 predicate places. [2022-12-06 00:19:52,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:52,907 INFO L89 Accepts]: Start accepts. Operand has 210 places, 768 transitions, 17623 flow [2022-12-06 00:19:52,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:52,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:52,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 768 transitions, 17623 flow [2022-12-06 00:19:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 768 transitions, 17623 flow [2022-12-06 00:19:53,928 INFO L130 PetriNetUnfolder]: 2159/5460 cut-off events. [2022-12-06 00:19:53,928 INFO L131 PetriNetUnfolder]: For 134516/134702 co-relation queries the response was YES. [2022-12-06 00:19:53,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47051 conditions, 5460 events. 2159/5460 cut-off events. For 134516/134702 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 51812 event pairs, 142 based on Foata normal form. 16/5446 useless extension candidates. Maximal degree in co-relation 46439. Up to 1989 conditions per place. [2022-12-06 00:19:54,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 768 transitions, 17623 flow [2022-12-06 00:19:54,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 3150 [2022-12-06 00:19:54,027 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:19:54,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1122 [2022-12-06 00:19:54,029 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 768 transitions, 17623 flow [2022-12-06 00:19:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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 00:19:54,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:54,029 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:54,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:19:54,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 00:19:54,235 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1710797201, now seen corresponding path program 1 times [2022-12-06 00:19:54,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:54,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549965396] [2022-12-06 00:19:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:54,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:19:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:54,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549965396] [2022-12-06 00:19:54,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549965396] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:54,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15441463] [2022-12-06 00:19:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:54,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:54,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:54,293 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:54,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:19:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:54,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:19:54,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:19:54,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:19:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15441463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:19:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:19:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 00:19:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958239335] [2022-12-06 00:19:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:19:54,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:19:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:19:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:19:54,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 00:19:54,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 768 transitions, 17623 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 00:19:54,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:54,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 00:19:54,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:57,617 INFO L130 PetriNetUnfolder]: 6799/11937 cut-off events. [2022-12-06 00:19:57,617 INFO L131 PetriNetUnfolder]: For 318572/318572 co-relation queries the response was YES. [2022-12-06 00:19:57,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106747 conditions, 11937 events. 6799/11937 cut-off events. For 318572/318572 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 89966 event pairs, 2632 based on Foata normal form. 76/12009 useless extension candidates. Maximal degree in co-relation 105076. Up to 9612 conditions per place. [2022-12-06 00:19:57,740 INFO L137 encePairwiseOnDemand]: 49/54 looper letters, 518 selfloop transitions, 0 changer transitions 210/728 dead transitions. [2022-12-06 00:19:57,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 728 transitions, 18176 flow [2022-12-06 00:19:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:19:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:19:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 00:19:57,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 00:19:57,741 INFO L175 Difference]: Start difference. First operand has 210 places, 768 transitions, 17623 flow. Second operand 4 states and 81 transitions. [2022-12-06 00:19:57,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 728 transitions, 18176 flow [2022-12-06 00:19:59,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 728 transitions, 17281 flow, removed 103 selfloop flow, removed 6 redundant places. [2022-12-06 00:19:59,396 INFO L231 Difference]: Finished difference. Result has 205 places, 518 transitions, 11031 flow [2022-12-06 00:19:59,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=15406, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11031, PETRI_PLACES=205, PETRI_TRANSITIONS=518} [2022-12-06 00:19:59,397 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 180 predicate places. [2022-12-06 00:19:59,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:59,398 INFO L89 Accepts]: Start accepts. Operand has 205 places, 518 transitions, 11031 flow [2022-12-06 00:19:59,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:59,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:59,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 518 transitions, 11031 flow [2022-12-06 00:19:59,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 518 transitions, 11031 flow [2022-12-06 00:20:00,095 INFO L130 PetriNetUnfolder]: 1672/4105 cut-off events. [2022-12-06 00:20:00,096 INFO L131 PetriNetUnfolder]: For 91110/91273 co-relation queries the response was YES. [2022-12-06 00:20:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34277 conditions, 4105 events. 1672/4105 cut-off events. For 91110/91273 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 36351 event pairs, 134 based on Foata normal form. 12/4092 useless extension candidates. Maximal degree in co-relation 33854. Up to 1445 conditions per place. [2022-12-06 00:20:00,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 518 transitions, 11031 flow [2022-12-06 00:20:00,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 2174 [2022-12-06 00:20:05,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:05,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5792 [2022-12-06 00:20:05,189 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 518 transitions, 11063 flow [2022-12-06 00:20:05,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 00:20:05,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:05,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:05,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 00:20:05,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 00:20:05,396 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1251396153, now seen corresponding path program 1 times [2022-12-06 00:20:05,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:05,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640145365] [2022-12-06 00:20:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:20:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:05,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640145365] [2022-12-06 00:20:05,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640145365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:05,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:05,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026206555] [2022-12-06 00:20:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:05,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:05,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:05,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:05,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:20:05,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 518 transitions, 11063 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 00:20:05,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:05,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:20:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:07,603 INFO L130 PetriNetUnfolder]: 4981/8655 cut-off events. [2022-12-06 00:20:07,603 INFO L131 PetriNetUnfolder]: For 202593/202593 co-relation queries the response was YES. [2022-12-06 00:20:07,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74311 conditions, 8655 events. 4981/8655 cut-off events. For 202593/202593 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 60914 event pairs, 1768 based on Foata normal form. 84/8739 useless extension candidates. Maximal degree in co-relation 73143. Up to 6912 conditions per place. [2022-12-06 00:20:07,707 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 508 selfloop transitions, 6 changer transitions 94/608 dead transitions. [2022-12-06 00:20:07,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 608 transitions, 14185 flow [2022-12-06 00:20:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 00:20:07,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-06 00:20:07,708 INFO L175 Difference]: Start difference. First operand has 174 places, 518 transitions, 11063 flow. Second operand 5 states and 51 transitions. [2022-12-06 00:20:07,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 608 transitions, 14185 flow [2022-12-06 00:20:08,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 608 transitions, 13236 flow, removed 328 selfloop flow, removed 17 redundant places. [2022-12-06 00:20:08,560 INFO L231 Difference]: Finished difference. Result has 163 places, 439 transitions, 8615 flow [2022-12-06 00:20:08,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=9424, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8615, PETRI_PLACES=163, PETRI_TRANSITIONS=439} [2022-12-06 00:20:08,560 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 138 predicate places. [2022-12-06 00:20:08,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:08,561 INFO L89 Accepts]: Start accepts. Operand has 163 places, 439 transitions, 8615 flow [2022-12-06 00:20:08,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:08,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:08,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 439 transitions, 8615 flow [2022-12-06 00:20:08,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 439 transitions, 8615 flow [2022-12-06 00:20:09,090 INFO L130 PetriNetUnfolder]: 1342/3344 cut-off events. [2022-12-06 00:20:09,090 INFO L131 PetriNetUnfolder]: For 58340/58383 co-relation queries the response was YES. [2022-12-06 00:20:09,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24154 conditions, 3344 events. 1342/3344 cut-off events. For 58340/58383 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28585 event pairs, 99 based on Foata normal form. 14/3342 useless extension candidates. Maximal degree in co-relation 23188. Up to 1174 conditions per place. [2022-12-06 00:20:09,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 439 transitions, 8615 flow [2022-12-06 00:20:09,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-06 00:20:13,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:13,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4963 [2022-12-06 00:20:13,524 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 439 transitions, 8647 flow [2022-12-06 00:20:13,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 00:20:13,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:13,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:13,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:20:13,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash 748558729, now seen corresponding path program 1 times [2022-12-06 00:20:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965813601] [2022-12-06 00:20:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:14,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:14,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965813601] [2022-12-06 00:20:14,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965813601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:14,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993003478] [2022-12-06 00:20:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:14,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:14,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:14,535 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:20:14,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 00:20:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:14,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 00:20:14,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:14,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:20:14,769 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:20:14,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 00:20:14,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 00:20:14,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 00:20:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:14,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:15,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:15,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 00:20:15,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-06 00:20:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:15,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993003478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:15,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:15,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 00:20:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922655727] [2022-12-06 00:20:15,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:15,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 00:20:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 00:20:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-12-06 00:20:15,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:20:15,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 439 transitions, 8647 flow. Second operand has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 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 00:20:15,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:15,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:20:15,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:18,836 INFO L130 PetriNetUnfolder]: 6196/10683 cut-off events. [2022-12-06 00:20:18,837 INFO L131 PetriNetUnfolder]: For 199729/199729 co-relation queries the response was YES. [2022-12-06 00:20:18,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81889 conditions, 10683 events. 6196/10683 cut-off events. For 199729/199729 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 75822 event pairs, 475 based on Foata normal form. 6/10689 useless extension candidates. Maximal degree in co-relation 79131. Up to 3505 conditions per place. [2022-12-06 00:20:18,943 INFO L137 encePairwiseOnDemand]: 9/30 looper letters, 350 selfloop transitions, 459 changer transitions 32/841 dead transitions. [2022-12-06 00:20:18,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 841 transitions, 16037 flow [2022-12-06 00:20:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 00:20:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 00:20:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 233 transitions. [2022-12-06 00:20:18,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.267816091954023 [2022-12-06 00:20:18,944 INFO L175 Difference]: Start difference. First operand has 155 places, 439 transitions, 8647 flow. Second operand 29 states and 233 transitions. [2022-12-06 00:20:18,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 841 transitions, 16037 flow [2022-12-06 00:20:19,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 841 transitions, 15168 flow, removed 145 selfloop flow, removed 9 redundant places. [2022-12-06 00:20:19,803 INFO L231 Difference]: Finished difference. Result has 187 places, 573 transitions, 12351 flow [2022-12-06 00:20:19,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=8120, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=12351, PETRI_PLACES=187, PETRI_TRANSITIONS=573} [2022-12-06 00:20:19,804 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 162 predicate places. [2022-12-06 00:20:19,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:19,804 INFO L89 Accepts]: Start accepts. Operand has 187 places, 573 transitions, 12351 flow [2022-12-06 00:20:19,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:19,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:19,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 573 transitions, 12351 flow [2022-12-06 00:20:19,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 573 transitions, 12351 flow [2022-12-06 00:20:20,570 INFO L130 PetriNetUnfolder]: 1833/4466 cut-off events. [2022-12-06 00:20:20,571 INFO L131 PetriNetUnfolder]: For 90119/90159 co-relation queries the response was YES. [2022-12-06 00:20:20,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34773 conditions, 4466 events. 1833/4466 cut-off events. For 90119/90159 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 39445 event pairs, 112 based on Foata normal form. 11/4455 useless extension candidates. Maximal degree in co-relation 34689. Up to 1584 conditions per place. [2022-12-06 00:20:20,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 573 transitions, 12351 flow [2022-12-06 00:20:20,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 2316 [2022-12-06 00:20:20,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:20:20,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:20,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1095 [2022-12-06 00:20:20,899 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 572 transitions, 12365 flow [2022-12-06 00:20:20,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 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 00:20:20,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:20,899 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:20,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 00:20:21,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:21,105 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2040207559, now seen corresponding path program 1 times [2022-12-06 00:20:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:21,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439673273] [2022-12-06 00:20:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439673273] [2022-12-06 00:20:22,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439673273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852489763] [2022-12-06 00:20:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:22,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:22,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:20:22,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 00:20:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:22,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 00:20:22,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:22,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-06 00:20:22,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 00:20:22,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:22,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 28 [2022-12-06 00:20:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:22,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:25,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:25,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 853 treesize of output 1748 [2022-12-06 00:20:25,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:25,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 570 treesize of output 692 [2022-12-06 00:20:25,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:25,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 495 treesize of output 564 [2022-12-06 00:20:25,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:25,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 444 Received shutdown request... [2022-12-06 00:31:06,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:31:06,297 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 00:31:06,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 00:31:06,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:06,319 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:31:06,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:06,504 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 51ms.. [2022-12-06 00:31:06,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 00:31:06,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 00:31:06,506 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:06,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:31:06,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:31:06,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:31:06 BasicIcfg [2022-12-06 00:31:06,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:31:06,509 INFO L158 Benchmark]: Toolchain (without parser) took 847949.68ms. Allocated memory was 184.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 161.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 00:31:06,509 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:31:06,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.32ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 147.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:31:06,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.71ms. Allocated memory is still 184.5MB. Free memory was 147.7MB in the beginning and 145.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:31:06,510 INFO L158 Benchmark]: Boogie Preprocessor took 30.55ms. Allocated memory is still 184.5MB. Free memory was 145.7MB in the beginning and 143.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:31:06,510 INFO L158 Benchmark]: RCFGBuilder took 574.80ms. Allocated memory is still 184.5MB. Free memory was 143.6MB in the beginning and 119.5MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 00:31:06,510 INFO L158 Benchmark]: TraceAbstraction took 847051.76ms. Allocated memory was 184.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 119.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 00:31:06,511 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.10ms. Allocated memory is still 184.5MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.32ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 147.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.71ms. Allocated memory is still 184.5MB. Free memory was 147.7MB in the beginning and 145.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.55ms. Allocated memory is still 184.5MB. Free memory was 145.7MB in the beginning and 143.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 574.80ms. Allocated memory is still 184.5MB. Free memory was 143.6MB in the beginning and 119.5MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 847051.76ms. Allocated memory was 184.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 119.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 423, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 423, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 423, unknown conditional: 0, unknown unconditional: 423] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 623, Positive conditional cache size: 0, Positive unconditional cache size: 623, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 25 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 21, unknown conditional: 2, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, 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.3s, 27 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 11, Negative conditional cache size: 4, Negative unconditional cache size: 7, 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, 30 PlacesBefore, 30 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 12, independent conditional: 7, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 13, Negative conditional cache size: 4, Negative unconditional cache size: 9, 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, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, 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, 35 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, 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.8s, 38 PlacesBefore, 37 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, 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: 13.3s, 72 PlacesBefore, 66 PlacesAfterwards, 129 TransitionsBefore, 123 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 616, independent: 563, independent conditional: 563, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 616, independent: 563, independent conditional: 404, independent unconditional: 159, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 616, independent: 563, independent conditional: 400, independent unconditional: 163, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 616, independent: 563, independent conditional: 400, independent unconditional: 163, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 616, independent: 551, independent conditional: 391, independent unconditional: 160, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 34, Positive conditional cache size: 11, Positive unconditional cache size: 23, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 107 PlacesBefore, 101 PlacesAfterwards, 279 TransitionsBefore, 273 TransitionsAfterwards, 1014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 37, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 50, Positive conditional cache size: 15, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 94 PlacesBefore, 94 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 992 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): 67, Positive cache size: 50, Positive conditional cache size: 15, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 99 PlacesBefore, 99 PlacesAfterwards, 314 TransitionsBefore, 314 TransitionsAfterwards, 1136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 51, Positive conditional cache size: 16, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 6.2s, 124 PlacesBefore, 124 PlacesAfterwards, 433 TransitionsBefore, 433 TransitionsAfterwards, 1640 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 68, Positive cache size: 51, Positive conditional cache size: 16, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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.9s, 146 PlacesBefore, 146 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 2322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 5, independent unconditional: 7, 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: 12, independent: 12, independent conditional: 5, independent unconditional: 7, 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: 12, independent: 12, independent conditional: 5, independent unconditional: 7, 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: 10, independent: 10, independent conditional: 5, independent unconditional: 5, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 163 PlacesBefore, 163 PlacesAfterwards, 723 TransitionsBefore, 723 TransitionsAfterwards, 3090 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 199 PlacesBefore, 199 PlacesAfterwards, 837 TransitionsBefore, 837 TransitionsAfterwards, 3508 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 5.8s, 199 PlacesBefore, 199 PlacesAfterwards, 864 TransitionsBefore, 864 TransitionsAfterwards, 3596 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 191 PlacesBefore, 191 PlacesAfterwards, 678 TransitionsBefore, 678 TransitionsAfterwards, 2726 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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, 210 PlacesBefore, 210 PlacesAfterwards, 768 TransitionsBefore, 768 TransitionsAfterwards, 3150 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): 79, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, 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: 5.0s, 174 PlacesBefore, 174 PlacesAfterwards, 518 TransitionsBefore, 518 TransitionsAfterwards, 2174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 450, independent: 336, independent conditional: 336, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 450, independent: 336, independent conditional: 112, independent unconditional: 224, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1020, independent: 336, independent conditional: 112, independent unconditional: 224, dependent: 684, dependent conditional: 456, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1020, independent: 336, independent conditional: 112, independent unconditional: 224, dependent: 684, dependent conditional: 456, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1020, independent: 336, independent conditional: 112, independent unconditional: 224, dependent: 676, dependent conditional: 448, dependent unconditional: 228, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 25, Negative conditional cache size: 14, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 228, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 155 PlacesBefore, 155 PlacesAfterwards, 439 TransitionsBefore, 439 TransitionsAfterwards, 1828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2162, independent: 2052, independent conditional: 2052, independent unconditional: 0, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2162, independent: 2052, independent conditional: 1836, independent unconditional: 216, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2492, independent: 2052, independent conditional: 1836, independent unconditional: 216, dependent: 440, dependent conditional: 440, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2492, independent: 2052, independent conditional: 1836, independent unconditional: 216, dependent: 440, dependent conditional: 440, 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: 2492, independent: 2052, independent conditional: 1836, independent unconditional: 216, dependent: 440, dependent conditional: 440, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 25, Negative conditional cache size: 14, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 185 PlacesBefore, 184 PlacesAfterwards, 573 TransitionsBefore, 572 TransitionsAfterwards, 2316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3640, independent: 3500, independent conditional: 3500, independent unconditional: 0, dependent: 140, dependent conditional: 140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3640, independent: 3500, independent conditional: 3360, independent unconditional: 140, dependent: 140, dependent conditional: 140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4060, independent: 3500, independent conditional: 3360, independent unconditional: 140, dependent: 560, dependent conditional: 560, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4060, independent: 3500, independent conditional: 3360, independent unconditional: 140, dependent: 560, dependent conditional: 560, 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: 4060, independent: 3500, independent conditional: 3360, independent unconditional: 140, dependent: 560, dependent conditional: 560, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 62, Positive conditional cache size: 21, Positive unconditional cache size: 41, Negative cache size: 25, Negative conditional cache size: 14, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 51ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 51ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 51ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 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: 846.9s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 76.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 54 mSolverCounterUnknown, 3241 SdHoareTripleChecker+Valid, 27.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3241 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 284 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 835 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8998 IncrementalHoareTripleChecker+Invalid, 10171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 835 mSolverCounterUnsat, 2 mSDtfsCounter, 8998 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 327 SyntacticMatches, 7 SemanticMatches, 336 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18642occurred in iteration=15, InterpolantAutomatonStates: 232, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 66.9s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 770 ConstructedInterpolants, 82 QuantifiedInterpolants, 15472 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3509 ConjunctsInSsa, 366 ConjunctsInUnsatCore, 44 InterpolantComputations, 10 PerfectInterpolantSequences, 49/121 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown