/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-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:13:40,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:13:40,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:13:40,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:13:40,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:13:40,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:13:40,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:13:40,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:13:41,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:13:41,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:13:41,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:13:41,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:13:41,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:13:41,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:13:41,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:13:41,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:13:41,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:13:41,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:13:41,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:13:41,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:13:41,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:13:41,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:13:41,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:13:41,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:13:41,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:13:41,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:13:41,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:13:41,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:13:41,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:13:41,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:13:41,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:13:41,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:13:41,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:13:41,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:13:41,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:13:41,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:13:41,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:13:41,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:13:41,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:13:41,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:13:41,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:13:41,059 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:13:41,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:13:41,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:13:41,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:13:41,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:13:41,090 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:13:41,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:13:41,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:13:41,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:13:41,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:13:41,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:13:41,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:13:41,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:13:41,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:13:41,092 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:13:41,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:13:41,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:13:41,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:13:41,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:13:41,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:13:41,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:13:41,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:13:41,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:13:41,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:13:41,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:13:41,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:13:41,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:13:41,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:13:41,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:13:41,095 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:13:41,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:13:41,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:13:41,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:13:41,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:13:41,407 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:13:41,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-12-06 00:13:42,479 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:13:42,737 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:13:42,737 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-12-06 00:13:42,750 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441349f80/9e9832d940114d719621e727b5b10421/FLAG9836a836b [2022-12-06 00:13:42,770 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441349f80/9e9832d940114d719621e727b5b10421 [2022-12-06 00:13:42,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:13:42,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:13:42,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:13:42,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:13:42,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:13:42,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:13:42" (1/1) ... [2022-12-06 00:13:42,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202fe8a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:42, skipping insertion in model container [2022-12-06 00:13:42,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:13:42" (1/1) ... [2022-12-06 00:13:42,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:13:42,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:13:42,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:42,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:42,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:42,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:42,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:42,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:42,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:42,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:42,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,002 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-array-sum-alt.wvr.c[2761,2774] [2022-12-06 00:13:43,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:13:43,029 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:13:43,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:43,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:43,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:43,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:43,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:43,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:43,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:43,070 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-array-sum-alt.wvr.c[2761,2774] [2022-12-06 00:13:43,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:13:43,091 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:13:43,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43 WrapperNode [2022-12-06 00:13:43,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:13:43,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:13:43,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:13:43,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:13:43,100 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:13:43" (1/1) ... [2022-12-06 00:13:43,117 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:13:43" (1/1) ... [2022-12-06 00:13:43,154 INFO L138 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-12-06 00:13:43,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:13:43,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:13:43,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:13:43,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:13:43,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:13:43,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:13:43,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:13:43,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:13:43,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (1/1) ... [2022-12-06 00:13:43,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:13:43,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:13:43,244 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:13:43,273 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:13:43,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:13:43,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:13:43,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:13:43,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:13:43,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:13:43,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:13:43,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:13:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:13:43,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:13:43,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:13:43,294 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:13:43,385 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:13:43,387 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:13:43,744 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:13:43,871 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:13:43,871 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:13:43,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:13:43 BoogieIcfgContainer [2022-12-06 00:13:43,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:13:43,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:13:43,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:13:43,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:13:43,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:13:42" (1/3) ... [2022-12-06 00:13:43,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b787087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:13:43, skipping insertion in model container [2022-12-06 00:13:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:43" (2/3) ... [2022-12-06 00:13:43,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b787087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:13:43, skipping insertion in model container [2022-12-06 00:13:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:13:43" (3/3) ... [2022-12-06 00:13:43,880 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-12-06 00:13:43,901 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:13:43,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:13:43,902 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:13:44,012 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:13:44,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 144 transitions, 312 flow [2022-12-06 00:13:44,155 INFO L130 PetriNetUnfolder]: 12/141 cut-off events. [2022-12-06 00:13:44,155 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:44,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 12/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 95 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-12-06 00:13:44,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 144 transitions, 312 flow [2022-12-06 00:13:44,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 131 transitions, 280 flow [2022-12-06 00:13:44,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:44,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 280 flow [2022-12-06 00:13:44,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 280 flow [2022-12-06 00:13:44,249 INFO L130 PetriNetUnfolder]: 12/131 cut-off events. [2022-12-06 00:13:44,250 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:44,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 12/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 94 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-12-06 00:13:44,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 131 transitions, 280 flow [2022-12-06 00:13:44,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 00:13:49,969 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-06 00:13:49,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:13:49,988 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;@471ffeff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:13:49,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:13:49,994 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 00:13:49,994 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:49,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:49,995 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:13:49,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1674226892, now seen corresponding path program 1 times [2022-12-06 00:13:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:50,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364270175] [2022-12-06 00:13:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:50,508 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:13:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:50,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364270175] [2022-12-06 00:13:50,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364270175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:50,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:50,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:13:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151446178] [2022-12-06 00:13:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:50,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:13:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:13:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:13:50,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 00:13:50,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:13:50,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:50,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 00:13:50,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:50,725 INFO L130 PetriNetUnfolder]: 619/869 cut-off events. [2022-12-06 00:13:50,725 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 00:13:50,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 869 events. 619/869 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3388 event pairs, 95 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 1365. Up to 688 conditions per place. [2022-12-06 00:13:50,736 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-06 00:13:50,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-06 00:13:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:13:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:13:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 00:13:50,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-06 00:13:50,750 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 70 flow. Second operand 3 states and 51 transitions. [2022-12-06 00:13:50,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 203 flow [2022-12-06 00:13:50,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 44 transitions, 181 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:13:50,757 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 84 flow [2022-12-06 00:13:50,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-06 00:13:50,762 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-06 00:13:50,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:50,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 84 flow [2022-12-06 00:13:50,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:50,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:50,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 84 flow [2022-12-06 00:13:50,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 84 flow [2022-12-06 00:13:50,775 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] thread3EXIT-->L101-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][27], [Black: 147#(= ~res2~0 ~res1~0), 145#true, 87#L101-2true]) [2022-12-06 00:13:50,776 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-06 00:13:50,776 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:13:50,776 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:13:50,776 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:13:50,776 INFO L130 PetriNetUnfolder]: 23/72 cut-off events. [2022-12-06 00:13:50,776 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:13:50,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 72 events. 23/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 187 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 72. Up to 26 conditions per place. [2022-12-06 00:13:50,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 84 flow [2022-12-06 00:13:50,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 00:13:50,785 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:50,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:13:50,786 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 84 flow [2022-12-06 00:13:50,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:13:50,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:50,787 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:13:50,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:13:50,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 693833528, now seen corresponding path program 1 times [2022-12-06 00:13:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719084351] [2022-12-06 00:13:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:50,903 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:13:50,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:50,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719084351] [2022-12-06 00:13:50,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719084351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:50,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:50,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735436478] [2022-12-06 00:13:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:50,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:13:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:13:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:13:50,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 00:13:50,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:13:50,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:50,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 00:13:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:51,155 INFO L130 PetriNetUnfolder]: 1155/1690 cut-off events. [2022-12-06 00:13:51,156 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-12-06 00:13:51,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1690 events. 1155/1690 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7700 event pairs, 608 based on Foata normal form. 62/1383 useless extension candidates. Maximal degree in co-relation 1013. Up to 880 conditions per place. [2022-12-06 00:13:51,167 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 60 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-06 00:13:51,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 66 transitions, 316 flow [2022-12-06 00:13:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:13:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:13:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 00:13:51,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-06 00:13:51,169 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 84 flow. Second operand 5 states and 68 transitions. [2022-12-06 00:13:51,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 66 transitions, 316 flow [2022-12-06 00:13:51,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 66 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:13:51,171 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 110 flow [2022-12-06 00:13:51,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2022-12-06 00:13:51,172 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-06 00:13:51,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:51,172 INFO L89 Accepts]: Start accepts. Operand has 35 places, 32 transitions, 110 flow [2022-12-06 00:13:51,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:51,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:51,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 32 transitions, 110 flow [2022-12-06 00:13:51,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 110 flow [2022-12-06 00:13:51,185 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] thread3EXIT-->L101-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][30], [Black: 155#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 0)), Black: 147#(= ~res2~0 ~res1~0), 149#true, 87#L101-2true, Black: 157#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 151#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2022-12-06 00:13:51,185 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-06 00:13:51,185 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:13:51,185 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:13:51,185 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:13:51,185 INFO L130 PetriNetUnfolder]: 30/113 cut-off events. [2022-12-06 00:13:51,185 INFO L131 PetriNetUnfolder]: For 8/11 co-relation queries the response was YES. [2022-12-06 00:13:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 113 events. 30/113 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 420 event pairs, 1 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 110. Up to 35 conditions per place. [2022-12-06 00:13:51,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 32 transitions, 110 flow [2022-12-06 00:13:51,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 00:13:53,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:53,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2004 [2022-12-06 00:13:53,176 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 116 flow [2022-12-06 00:13:53,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:13:53,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:53,177 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:13:53,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:13:53,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 997092377, now seen corresponding path program 1 times [2022-12-06 00:13:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:53,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944208683] [2022-12-06 00:13:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:53,280 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:13:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:53,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944208683] [2022-12-06 00:13:53,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944208683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:53,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:53,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:13:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023204059] [2022-12-06 00:13:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:53,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:13:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:13:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:13:53,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 00:13:53,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:13:53,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:53,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 00:13:53,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:53,714 INFO L130 PetriNetUnfolder]: 1377/2035 cut-off events. [2022-12-06 00:13:53,714 INFO L131 PetriNetUnfolder]: For 706/782 co-relation queries the response was YES. [2022-12-06 00:13:53,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 2035 events. 1377/2035 cut-off events. For 706/782 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9626 event pairs, 437 based on Foata normal form. 76/1812 useless extension candidates. Maximal degree in co-relation 3286. Up to 521 conditions per place. [2022-12-06 00:13:53,727 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 105 selfloop transitions, 22 changer transitions 1/130 dead transitions. [2022-12-06 00:13:53,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 130 transitions, 659 flow [2022-12-06 00:13:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:13:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:13:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-06 00:13:53,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-06 00:13:53,732 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 116 flow. Second operand 9 states and 124 transitions. [2022-12-06 00:13:53,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 130 transitions, 659 flow [2022-12-06 00:13:53,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 130 transitions, 651 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 00:13:53,739 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 263 flow [2022-12-06 00:13:53,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=263, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2022-12-06 00:13:53,740 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-12-06 00:13:53,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:53,740 INFO L89 Accepts]: Start accepts. Operand has 48 places, 50 transitions, 263 flow [2022-12-06 00:13:53,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:53,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:53,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 50 transitions, 263 flow [2022-12-06 00:13:53,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 50 transitions, 263 flow [2022-12-06 00:13:53,759 INFO L130 PetriNetUnfolder]: 56/174 cut-off events. [2022-12-06 00:13:53,761 INFO L131 PetriNetUnfolder]: For 102/112 co-relation queries the response was YES. [2022-12-06 00:13:53,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 174 events. 56/174 cut-off events. For 102/112 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 767 event pairs, 0 based on Foata normal form. 3/166 useless extension candidates. Maximal degree in co-relation 329. Up to 52 conditions per place. [2022-12-06 00:13:53,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 50 transitions, 263 flow [2022-12-06 00:13:53,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 00:13:53,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:53,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 00:13:53,783 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 263 flow [2022-12-06 00:13:53,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:13:53,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:53,784 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:13:53,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:13:53,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1568792965, now seen corresponding path program 2 times [2022-12-06 00:13:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604567558] [2022-12-06 00:13:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:53,931 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:13:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604567558] [2022-12-06 00:13:53,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604567558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:53,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:53,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:13:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366583596] [2022-12-06 00:13:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:53,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:13:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:13:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:13:53,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 00:13:53,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:13:53,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:53,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 00:13:53,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:54,371 INFO L130 PetriNetUnfolder]: 1778/2619 cut-off events. [2022-12-06 00:13:54,372 INFO L131 PetriNetUnfolder]: For 3204/3280 co-relation queries the response was YES. [2022-12-06 00:13:54,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8260 conditions, 2619 events. 1778/2619 cut-off events. For 3204/3280 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12588 event pairs, 726 based on Foata normal form. 88/2703 useless extension candidates. Maximal degree in co-relation 6246. Up to 1072 conditions per place. [2022-12-06 00:13:54,390 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 104 selfloop transitions, 13 changer transitions 0/119 dead transitions. [2022-12-06 00:13:54,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 119 transitions, 807 flow [2022-12-06 00:13:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:13:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:13:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 00:13:54,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2022-12-06 00:13:54,392 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 263 flow. Second operand 6 states and 88 transitions. [2022-12-06 00:13:54,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 119 transitions, 807 flow [2022-12-06 00:13:54,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 803 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 00:13:54,407 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 382 flow [2022-12-06 00:13:54,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-06 00:13:54,408 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2022-12-06 00:13:54,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:54,408 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 382 flow [2022-12-06 00:13:54,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:54,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:54,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 382 flow [2022-12-06 00:13:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 382 flow [2022-12-06 00:13:54,433 INFO L130 PetriNetUnfolder]: 53/177 cut-off events. [2022-12-06 00:13:54,433 INFO L131 PetriNetUnfolder]: For 182/193 co-relation queries the response was YES. [2022-12-06 00:13:54,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 177 events. 53/177 cut-off events. For 182/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 788 event pairs, 1 based on Foata normal form. 3/169 useless extension candidates. Maximal degree in co-relation 379. Up to 56 conditions per place. [2022-12-06 00:13:54,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 382 flow [2022-12-06 00:13:54,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-06 00:13:54,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L73-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_In_3| v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_3|, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_4|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base] and [513] $Ultimate##0-->L60-4: Formula: (= |v_thread2Thread1of1ForFork2_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1] [2022-12-06 00:13:54,483 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:54,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 00:13:54,484 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 356 flow [2022-12-06 00:13:54,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:13:54,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:54,485 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:13:54,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:13:54,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1445137536, now seen corresponding path program 1 times [2022-12-06 00:13:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:54,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436984223] [2022-12-06 00:13:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:54,607 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:13:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:54,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436984223] [2022-12-06 00:13:54,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436984223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:54,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:54,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:13:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101139929] [2022-12-06 00:13:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:54,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:54,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:54,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 00:13:54,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:13:54,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:54,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 00:13:54,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:54,909 INFO L130 PetriNetUnfolder]: 1405/2085 cut-off events. [2022-12-06 00:13:54,909 INFO L131 PetriNetUnfolder]: For 4437/4485 co-relation queries the response was YES. [2022-12-06 00:13:54,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7349 conditions, 2085 events. 1405/2085 cut-off events. For 4437/4485 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9690 event pairs, 710 based on Foata normal form. 94/2175 useless extension candidates. Maximal degree in co-relation 6077. Up to 1683 conditions per place. [2022-12-06 00:13:54,924 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 75 selfloop transitions, 2 changer transitions 1/80 dead transitions. [2022-12-06 00:13:54,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 592 flow [2022-12-06 00:13:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 00:13:54,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-06 00:13:54,925 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 356 flow. Second operand 4 states and 61 transitions. [2022-12-06 00:13:54,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 592 flow [2022-12-06 00:13:54,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 587 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:13:54,939 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 336 flow [2022-12-06 00:13:54,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-06 00:13:54,940 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2022-12-06 00:13:54,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:54,941 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 336 flow [2022-12-06 00:13:54,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:54,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:54,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 336 flow [2022-12-06 00:13:54,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 336 flow [2022-12-06 00:13:54,956 INFO L130 PetriNetUnfolder]: 41/139 cut-off events. [2022-12-06 00:13:54,956 INFO L131 PetriNetUnfolder]: For 132/137 co-relation queries the response was YES. [2022-12-06 00:13:54,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 139 events. 41/139 cut-off events. For 132/137 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 550 event pairs, 1 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 333. Up to 42 conditions per place. [2022-12-06 00:13:54,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 336 flow [2022-12-06 00:13:54,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 00:13:55,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:55,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:13:55,163 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 332 flow [2022-12-06 00:13:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:13:55,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:55,164 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:13:55,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:13:55,164 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -565878226, now seen corresponding path program 1 times [2022-12-06 00:13:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:55,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006984751] [2022-12-06 00:13:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:55,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:55,334 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:13:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:55,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006984751] [2022-12-06 00:13:55,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006984751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:55,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:55,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:13:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705089] [2022-12-06 00:13:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:55,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:55,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 00:13:55,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:13:55,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:55,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 00:13:55,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:55,578 INFO L130 PetriNetUnfolder]: 1113/1638 cut-off events. [2022-12-06 00:13:55,579 INFO L131 PetriNetUnfolder]: For 3497/3556 co-relation queries the response was YES. [2022-12-06 00:13:55,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5930 conditions, 1638 events. 1113/1638 cut-off events. For 3497/3556 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7265 event pairs, 503 based on Foata normal form. 73/1697 useless extension candidates. Maximal degree in co-relation 5566. Up to 1292 conditions per place. [2022-12-06 00:13:55,590 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 54 selfloop transitions, 1 changer transitions 25/83 dead transitions. [2022-12-06 00:13:55,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 594 flow [2022-12-06 00:13:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:13:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:13:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 00:13:55,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2022-12-06 00:13:55,592 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 332 flow. Second operand 5 states and 68 transitions. [2022-12-06 00:13:55,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 594 flow [2022-12-06 00:13:55,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 558 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 00:13:55,606 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 269 flow [2022-12-06 00:13:55,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-06 00:13:55,609 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-06 00:13:55,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:55,609 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 269 flow [2022-12-06 00:13:55,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:55,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:55,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 269 flow [2022-12-06 00:13:55,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 269 flow [2022-12-06 00:13:55,625 INFO L130 PetriNetUnfolder]: 46/128 cut-off events. [2022-12-06 00:13:55,625 INFO L131 PetriNetUnfolder]: For 87/89 co-relation queries the response was YES. [2022-12-06 00:13:55,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 128 events. 46/128 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 324. Up to 45 conditions per place. [2022-12-06 00:13:55,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 46 transitions, 269 flow [2022-12-06 00:13:55,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 00:13:55,628 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:55,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 00:13:55,629 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 269 flow [2022-12-06 00:13:55,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:13:55,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:55,629 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:13:55,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:13:55,629 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1561468071, now seen corresponding path program 1 times [2022-12-06 00:13:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:55,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051560517] [2022-12-06 00:13:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:55,711 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:13:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:55,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051560517] [2022-12-06 00:13:55,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051560517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:55,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:55,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:13:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015281665] [2022-12-06 00:13:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:55,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:55,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:55,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:55,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:55,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 00:13:55,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:13:55,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:55,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 00:13:55,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:55,873 INFO L130 PetriNetUnfolder]: 955/1400 cut-off events. [2022-12-06 00:13:55,873 INFO L131 PetriNetUnfolder]: For 2673/2740 co-relation queries the response was YES. [2022-12-06 00:13:55,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 1400 events. 955/1400 cut-off events. For 2673/2740 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5776 event pairs, 388 based on Foata normal form. 151/1537 useless extension candidates. Maximal degree in co-relation 4009. Up to 1093 conditions per place. [2022-12-06 00:13:55,888 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 65 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2022-12-06 00:13:55,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 581 flow [2022-12-06 00:13:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 00:13:55,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-06 00:13:55,889 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 269 flow. Second operand 4 states and 45 transitions. [2022-12-06 00:13:55,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 581 flow [2022-12-06 00:13:55,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 543 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 00:13:55,902 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 261 flow [2022-12-06 00:13:55,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2022-12-06 00:13:55,903 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-12-06 00:13:55,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:55,903 INFO L89 Accepts]: Start accepts. Operand has 45 places, 47 transitions, 261 flow [2022-12-06 00:13:55,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:55,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:55,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 261 flow [2022-12-06 00:13:55,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 261 flow [2022-12-06 00:13:55,916 INFO L130 PetriNetUnfolder]: 43/118 cut-off events. [2022-12-06 00:13:55,917 INFO L131 PetriNetUnfolder]: For 71/83 co-relation queries the response was YES. [2022-12-06 00:13:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 118 events. 43/118 cut-off events. For 71/83 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 387 event pairs, 0 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 288. Up to 43 conditions per place. [2022-12-06 00:13:55,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 261 flow [2022-12-06 00:13:55,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 00:13:55,921 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 00:13:55,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:55,928 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 00:13:55,929 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 247 flow [2022-12-06 00:13:55,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:55,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:13:55,930 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:13:55,932 INFO L158 Benchmark]: Toolchain (without parser) took 13159.06ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 171.5MB in the beginning and 149.3MB in the end (delta: 22.2MB). Peak memory consumption was 167.3MB. Max. memory is 8.0GB. [2022-12-06 00:13:55,932 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:13:55,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.21ms. Allocated memory is still 195.0MB. Free memory was 171.5MB in the beginning and 158.2MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:13:55,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.09ms. Allocated memory is still 195.0MB. Free memory was 158.2MB in the beginning and 156.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:55,933 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 195.0MB. Free memory was 156.1MB in the beginning and 154.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:55,933 INFO L158 Benchmark]: RCFGBuilder took 668.79ms. Allocated memory is still 195.0MB. Free memory was 154.0MB in the beginning and 122.0MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 00:13:55,934 INFO L158 Benchmark]: TraceAbstraction took 12056.77ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 121.0MB in the beginning and 149.3MB in the end (delta: -28.3MB). Peak memory consumption was 116.9MB. Max. memory is 8.0GB. [2022-12-06 00:13:55,935 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.11ms. Allocated memory is still 195.0MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.21ms. Allocated memory is still 195.0MB. Free memory was 171.5MB in the beginning and 158.2MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.09ms. Allocated memory is still 195.0MB. Free memory was 158.2MB in the beginning and 156.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 195.0MB. Free memory was 156.1MB in the beginning and 154.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 668.79ms. Allocated memory is still 195.0MB. Free memory was 154.0MB in the beginning and 122.0MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12056.77ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 121.0MB in the beginning and 149.3MB in the end (delta: -28.3MB). Peak memory consumption was 116.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 129 PlacesBefore, 32 PlacesAfterwards, 131 TransitionsBefore, 26 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 31 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 833, independent: 815, independent conditional: 815, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 833, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 833, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 833, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 785, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 785, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 833, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 785, unknown conditional: 0, unknown unconditional: 785] , Statistics on independence cache: Total cache size (in pairs): 1250, Positive cache size: 1240, Positive conditional cache size: 0, Positive unconditional cache size: 1240, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, 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: 1, dependent unconditional: 1, 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: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 3, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, 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: 2.0s, 35 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 8, independent unconditional: 18, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 26, independent conditional: 6, independent unconditional: 20, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 6, independent unconditional: 20, dependent: 4, dependent conditional: 2, dependent unconditional: 2, 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: 30, independent: 26, independent conditional: 6, independent unconditional: 20, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 9, 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: 15, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 6, dependent conditional: 5, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 13, Positive conditional cache size: 2, Positive unconditional cache size: 11, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, 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, 55 PlacesBefore, 54 PlacesAfterwards, 58 TransitionsBefore, 55 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 97, independent conditional: 55, independent unconditional: 42, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 97, independent conditional: 35, independent unconditional: 62, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 97, independent conditional: 35, independent unconditional: 62, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 15, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 111, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 24, unknown conditional: 16, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 36, Positive conditional cache size: 17, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 4, independent unconditional: 22, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 50, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 17, Positive unconditional cache size: 21, Negative cache size: 7, Negative conditional cache size: 5, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 17, Positive unconditional cache size: 21, Negative cache size: 7, Negative conditional cache size: 5, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 47 TransitionsBefore, 45 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 60, independent unconditional: 8, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 68, independent conditional: 10, independent unconditional: 58, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 68, independent conditional: 10, independent unconditional: 58, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 84, independent: 57, independent conditional: 9, independent unconditional: 48, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 49, Positive conditional cache size: 18, Positive unconditional cache size: 31, Negative cache size: 8, Negative conditional cache size: 6, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 1 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:13:55,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...