/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:24:22,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:24:22,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:24:22,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:24:22,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:24:22,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:24:22,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:24:22,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:24:22,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:24:22,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:24:22,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:24:22,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:24:22,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:24:22,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:24:22,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:24:22,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:24:22,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:24:22,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:24:22,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:24:22,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:24:22,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:24:22,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:24:22,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:24:22,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:24:22,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:24:22,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:24:22,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:24:22,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:24:22,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:24:22,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:24:22,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:24:22,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:24:22,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:24:22,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:24:22,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:24:22,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:24:22,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:24:22,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:24:22,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:24:22,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:24:22,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:24:22,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:24:22,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:24:22,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:24:22,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:24:22,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:24:22,425 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:24:22,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:24:22,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:24:22,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:24:22,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:24:22,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:24:22,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:24:22,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:24:22,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:24:22,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:24:22,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:24:22,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:24:22,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:24:22,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:24:22,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:24:22,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:24:22,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:24:22,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:24:22,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:24:22,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:24:22,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:24:22,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:24:22,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:24:22,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:24:22,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:24:22,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:24:22,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:24:22,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:24:22,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:24:22,742 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:24:22,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-06 05:24:23,625 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:24:23,820 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:24:23,820 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-06 05:24:23,829 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69aedb25/87c66f90daef45eeae051783e3881379/FLAGf5c77ce5a [2022-12-06 05:24:23,846 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69aedb25/87c66f90daef45eeae051783e3881379 [2022-12-06 05:24:23,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:24:23,849 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:24:23,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:24:23,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:24:23,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:24:23,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:24:23" (1/1) ... [2022-12-06 05:24:23,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403f4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:23, skipping insertion in model container [2022-12-06 05:24:23,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:24:23" (1/1) ... [2022-12-06 05:24:23,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:24:23,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:24:24,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,064 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-bad-ring-nondet.wvr.c[4085,4098] [2022-12-06 05:24:24,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:24:24,089 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:24:24,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:24,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:24,134 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-bad-ring-nondet.wvr.c[4085,4098] [2022-12-06 05:24:24,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:24:24,157 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:24:24,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24 WrapperNode [2022-12-06 05:24:24,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:24:24,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:24:24,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:24:24,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:24:24,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,205 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 317 [2022-12-06 05:24:24,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:24:24,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:24:24,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:24:24,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:24:24,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,263 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:24:24,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:24:24,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:24:24,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:24:24,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (1/1) ... [2022-12-06 05:24:24,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:24:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:24,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:24:24,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:24:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:24:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:24:24,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:24:24,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:24:24,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:24:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:24:24,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:24:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:24:24,327 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:24:24,403 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:24:24,405 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:24:24,790 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:24:24,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:24:24,914 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:24:24,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:24:24 BoogieIcfgContainer [2022-12-06 05:24:24,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:24:24,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:24:24,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:24:24,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:24:24,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:24:23" (1/3) ... [2022-12-06 05:24:24,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea78a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:24:24, skipping insertion in model container [2022-12-06 05:24:24,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:24" (2/3) ... [2022-12-06 05:24:24,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea78a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:24:24, skipping insertion in model container [2022-12-06 05:24:24,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:24:24" (3/3) ... [2022-12-06 05:24:24,924 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2022-12-06 05:24:24,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:24:24,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:24:24,938 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:24:25,008 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:24:25,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 536 flow [2022-12-06 05:24:25,212 INFO L130 PetriNetUnfolder]: 25/253 cut-off events. [2022-12-06 05:24:25,212 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:25,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 25/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-06 05:24:25,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 536 flow [2022-12-06 05:24:25,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 504 flow [2022-12-06 05:24:25,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:25,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-06 05:24:25,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 504 flow [2022-12-06 05:24:25,294 INFO L130 PetriNetUnfolder]: 25/243 cut-off events. [2022-12-06 05:24:25,294 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:25,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 243 events. 25/243 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-06 05:24:25,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-06 05:24:25,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-06 05:24:34,225 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 05:24:34,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:24:34,243 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;@672347ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:24:34,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:24:34,255 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 05:24:34,255 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:34,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:34,256 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 05:24:34,256 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 05:24:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1935456720, now seen corresponding path program 1 times [2022-12-06 05:24:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:34,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798915896] [2022-12-06 05:24:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798915896] [2022-12-06 05:24:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798915896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:34,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:24:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076872197] [2022-12-06 05:24:34,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:24:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:34,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:24:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:24:34,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:24:34,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:34,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:34,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:24:34,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:34,826 INFO L130 PetriNetUnfolder]: 472/693 cut-off events. [2022-12-06 05:24:34,826 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 05:24:34,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 693 events. 472/693 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2150 event pairs, 135 based on Foata normal form. 30/576 useless extension candidates. Maximal degree in co-relation 1219. Up to 449 conditions per place. [2022-12-06 05:24:34,834 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-06 05:24:34,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 198 flow [2022-12-06 05:24:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:24:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:24:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 05:24:34,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-06 05:24:34,845 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 3 states and 52 transitions. [2022-12-06 05:24:34,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 198 flow [2022-12-06 05:24:34,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:24:34,853 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 89 flow [2022-12-06 05:24:34,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-06 05:24:34,860 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 05:24:34,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:34,861 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 89 flow [2022-12-06 05:24:34,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:34,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:34,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 89 flow [2022-12-06 05:24:34,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 89 flow [2022-12-06 05:24:34,876 INFO L130 PetriNetUnfolder]: 14/44 cut-off events. [2022-12-06 05:24:34,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:24:34,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 44 events. 14/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-06 05:24:34,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 89 flow [2022-12-06 05:24:34,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 05:24:34,900 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:34,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 05:24:34,902 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 89 flow [2022-12-06 05:24:34,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:34,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:34,902 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, 1] [2022-12-06 05:24:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:24:34,905 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 05:24:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1141673692, now seen corresponding path program 1 times [2022-12-06 05:24:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:34,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189021020] [2022-12-06 05:24:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:35,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189021020] [2022-12-06 05:24:35,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189021020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:35,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:24:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887505632] [2022-12-06 05:24:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:35,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:35,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:24:35,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:35,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:35,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:24:35,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:35,196 INFO L130 PetriNetUnfolder]: 501/754 cut-off events. [2022-12-06 05:24:35,196 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 05:24:35,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 754 events. 501/754 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2341 event pairs, 344 based on Foata normal form. 26/630 useless extension candidates. Maximal degree in co-relation 631. Up to 691 conditions per place. [2022-12-06 05:24:35,199 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 2 changer transitions 14/48 dead transitions. [2022-12-06 05:24:35,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 216 flow [2022-12-06 05:24:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 05:24:35,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-06 05:24:35,201 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 89 flow. Second operand 4 states and 52 transitions. [2022-12-06 05:24:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 216 flow [2022-12-06 05:24:35,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:24:35,202 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 104 flow [2022-12-06 05:24:35,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-06 05:24:35,203 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 05:24:35,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:35,203 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 104 flow [2022-12-06 05:24:35,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:35,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:35,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 104 flow [2022-12-06 05:24:35,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:35,210 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-06 05:24:35,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:24:35,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 65 events. 22/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 165 event pairs, 4 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 100. Up to 17 conditions per place. [2022-12-06 05:24:35,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:35,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 05:24:36,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:36,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1424 [2022-12-06 05:24:36,627 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 100 flow [2022-12-06 05:24:36,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:36,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:36,628 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, 1] [2022-12-06 05:24:36,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:24:36,628 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 05:24:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1336645822, now seen corresponding path program 1 times [2022-12-06 05:24:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:36,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079958133] [2022-12-06 05:24:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:36,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:36,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079958133] [2022-12-06 05:24:36,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079958133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:36,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:36,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889221187] [2022-12-06 05:24:36,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:36,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:24:36,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:36,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:36,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:24:36,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:36,904 INFO L130 PetriNetUnfolder]: 759/1175 cut-off events. [2022-12-06 05:24:36,904 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-06 05:24:36,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1175 events. 759/1175 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4437 event pairs, 563 based on Foata normal form. 56/1041 useless extension candidates. Maximal degree in co-relation 2890. Up to 691 conditions per place. [2022-12-06 05:24:36,908 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 2 changer transitions 35/69 dead transitions. [2022-12-06 05:24:36,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 328 flow [2022-12-06 05:24:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:24:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:24:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 05:24:36,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-06 05:24:36,909 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 100 flow. Second operand 5 states and 75 transitions. [2022-12-06 05:24:36,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 328 flow [2022-12-06 05:24:36,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 320 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:36,911 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2022-12-06 05:24:36,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-06 05:24:36,912 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 05:24:36,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:36,912 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 114 flow [2022-12-06 05:24:36,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:36,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:36,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 114 flow [2022-12-06 05:24:36,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 114 flow [2022-12-06 05:24:36,920 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-06 05:24:36,920 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:24:36,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 65 events. 22/65 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 164 event pairs, 4 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 103. Up to 17 conditions per place. [2022-12-06 05:24:36,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 114 flow [2022-12-06 05:24:36,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 05:24:37,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:37,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 05:24:37,179 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 110 flow [2022-12-06 05:24:37,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:37,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:37,179 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, 1] [2022-12-06 05:24:37,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:24:37,180 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 05:24:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1117791104, now seen corresponding path program 1 times [2022-12-06 05:24:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:37,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593699194] [2022-12-06 05:24:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:37,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593699194] [2022-12-06 05:24:37,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593699194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:37,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:37,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32215648] [2022-12-06 05:24:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:37,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:37,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:37,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:37,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:24:37,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:37,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:37,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:24:37,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:37,406 INFO L130 PetriNetUnfolder]: 835/1241 cut-off events. [2022-12-06 05:24:37,407 INFO L131 PetriNetUnfolder]: For 523/523 co-relation queries the response was YES. [2022-12-06 05:24:37,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 1241 events. 835/1241 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4512 event pairs, 586 based on Foata normal form. 32/1034 useless extension candidates. Maximal degree in co-relation 3350. Up to 691 conditions per place. [2022-12-06 05:24:37,412 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 2 changer transitions 22/56 dead transitions. [2022-12-06 05:24:37,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 295 flow [2022-12-06 05:24:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 05:24:37,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2022-12-06 05:24:37,413 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 110 flow. Second operand 4 states and 57 transitions. [2022-12-06 05:24:37,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 295 flow [2022-12-06 05:24:37,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 267 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 05:24:37,415 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 108 flow [2022-12-06 05:24:37,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-06 05:24:37,416 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 05:24:37,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:37,416 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 108 flow [2022-12-06 05:24:37,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:37,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:37,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 108 flow [2022-12-06 05:24:37,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 108 flow [2022-12-06 05:24:37,430 INFO L130 PetriNetUnfolder]: 22/65 cut-off events. [2022-12-06 05:24:37,430 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:37,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 65 events. 22/65 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 166 event pairs, 4 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 104. Up to 17 conditions per place. [2022-12-06 05:24:37,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 108 flow [2022-12-06 05:24:37,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 05:24:37,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:37,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 05:24:37,657 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 104 flow [2022-12-06 05:24:37,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:37,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:37,658 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, 1] [2022-12-06 05:24:37,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:24:37,658 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 05:24:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -272387452, now seen corresponding path program 1 times [2022-12-06 05:24:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:37,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512770509] [2022-12-06 05:24:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512770509] [2022-12-06 05:24:37,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512770509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:37,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:37,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:24:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138612847] [2022-12-06 05:24:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:37,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:24:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:24:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:24:37,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:24:37,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 104 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 05:24:37,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:37,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:24:37,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:37,910 INFO L130 PetriNetUnfolder]: 839/1273 cut-off events. [2022-12-06 05:24:37,910 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-06 05:24:37,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1273 events. 839/1273 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4833 event pairs, 317 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 3303. Up to 645 conditions per place. [2022-12-06 05:24:37,915 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 46 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2022-12-06 05:24:37,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 283 flow [2022-12-06 05:24:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:24:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:24:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:24:37,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-06 05:24:37,916 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 104 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:24:37,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 283 flow [2022-12-06 05:24:37,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 267 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:37,919 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:37,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-06 05:24:37,919 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 05:24:37,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:37,919 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:37,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:37,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:37,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:37,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:37,927 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-06 05:24:37,928 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:24:37,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 85 events. 24/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 8 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 100. Up to 23 conditions per place. [2022-12-06 05:24:37,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:37,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 05:24:37,933 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:37,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:24:37,934 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 104 flow [2022-12-06 05:24:37,934 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 05:24:37,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:37,934 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, 1, 1, 1, 1] [2022-12-06 05:24:37,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:24:37,934 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 05:24:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1843002909, now seen corresponding path program 1 times [2022-12-06 05:24:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:37,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117668470] [2022-12-06 05:24:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117668470] [2022-12-06 05:24:38,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117668470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795418893] [2022-12-06 05:24:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:38,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:38,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:38,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:38,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:24:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:38,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:24:38,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:38,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:24:38,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795418893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:38,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:24:38,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-12-06 05:24:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174699287] [2022-12-06 05:24:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:38,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:24:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:24:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:24:38,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:24:38,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 104 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 05:24:38,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:38,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:24:38,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:38,526 INFO L130 PetriNetUnfolder]: 687/1042 cut-off events. [2022-12-06 05:24:38,526 INFO L131 PetriNetUnfolder]: For 197/197 co-relation queries the response was YES. [2022-12-06 05:24:38,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1042 events. 687/1042 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3679 event pairs, 219 based on Foata normal form. 24/869 useless extension candidates. Maximal degree in co-relation 1085. Up to 913 conditions per place. [2022-12-06 05:24:38,542 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2022-12-06 05:24:38,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 218 flow [2022-12-06 05:24:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:24:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:24:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 05:24:38,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2022-12-06 05:24:38,543 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 104 flow. Second operand 3 states and 43 transitions. [2022-12-06 05:24:38,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 218 flow [2022-12-06 05:24:38,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:24:38,545 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 112 flow [2022-12-06 05:24:38,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-06 05:24:38,548 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 05:24:38,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:38,548 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 112 flow [2022-12-06 05:24:38,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:38,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:38,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 112 flow [2022-12-06 05:24:38,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 112 flow [2022-12-06 05:24:38,560 INFO L130 PetriNetUnfolder]: 38/87 cut-off events. [2022-12-06 05:24:38,561 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:24:38,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 87 events. 38/87 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 204 event pairs, 4 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 148. Up to 49 conditions per place. [2022-12-06 05:24:38,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 112 flow [2022-12-06 05:24:38,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 05:24:38,562 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:38,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:24:38,563 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 112 flow [2022-12-06 05:24:38,563 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 05:24:38,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:38,563 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, 1, 1, 1, 1] [2022-12-06 05:24:38,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:24:38,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 05:24:38,770 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 05:24:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1446430485, now seen corresponding path program 2 times [2022-12-06 05:24:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:38,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275670508] [2022-12-06 05:24:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:39,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:39,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275670508] [2022-12-06 05:24:39,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275670508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:39,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697471196] [2022-12-06 05:24:39,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:24:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:39,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:39,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:24:39,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:24:39,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:24:39,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:24:39,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:39,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-06 05:24:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:39,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:39,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-06 05:24:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:39,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697471196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:39,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:39,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:24:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527642872] [2022-12-06 05:24:39,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:39,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:24:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:24:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:24:39,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:24:39,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 112 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:39,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:39,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:24:39,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:40,044 INFO L130 PetriNetUnfolder]: 1305/1940 cut-off events. [2022-12-06 05:24:40,044 INFO L131 PetriNetUnfolder]: For 750/750 co-relation queries the response was YES. [2022-12-06 05:24:40,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 1940 events. 1305/1940 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7729 event pairs, 102 based on Foata normal form. 89/1787 useless extension candidates. Maximal degree in co-relation 2230. Up to 473 conditions per place. [2022-12-06 05:24:40,050 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 60 selfloop transitions, 6 changer transitions 97/163 dead transitions. [2022-12-06 05:24:40,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 163 transitions, 821 flow [2022-12-06 05:24:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:24:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:24:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-12-06 05:24:40,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38213399503722084 [2022-12-06 05:24:40,053 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 112 flow. Second operand 13 states and 154 transitions. [2022-12-06 05:24:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 163 transitions, 821 flow [2022-12-06 05:24:40,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 163 transitions, 813 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:40,056 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 149 flow [2022-12-06 05:24:40,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=149, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-06 05:24:40,057 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-06 05:24:40,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:40,057 INFO L89 Accepts]: Start accepts. Operand has 53 places, 37 transitions, 149 flow [2022-12-06 05:24:40,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:40,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:40,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 149 flow [2022-12-06 05:24:40,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 149 flow [2022-12-06 05:24:40,068 INFO L130 PetriNetUnfolder]: 40/91 cut-off events. [2022-12-06 05:24:40,068 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2022-12-06 05:24:40,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 91 events. 40/91 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 197 event pairs, 4 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 196. Up to 49 conditions per place. [2022-12-06 05:24:40,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 149 flow [2022-12-06 05:24:40,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 05:24:41,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:41,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1595 [2022-12-06 05:24:41,652 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 145 flow [2022-12-06 05:24:41,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:41,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:41,652 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:41,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 05:24:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 05:24:41,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1673873069, now seen corresponding path program 1 times [2022-12-06 05:24:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304393266] [2022-12-06 05:24:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:42,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304393266] [2022-12-06 05:24:42,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304393266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:42,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304157582] [2022-12-06 05:24:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:42,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:42,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:42,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:42,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:24:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:42,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:24:42,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:42,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-06 05:24:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:42,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:42,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-06 05:24:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:43,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304157582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:43,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:43,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 05:24:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90698458] [2022-12-06 05:24:43,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:43,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:24:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:24:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-06 05:24:43,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:24:43,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 145 flow. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:43,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:43,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:24:43,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:45,320 INFO L130 PetriNetUnfolder]: 5359/7745 cut-off events. [2022-12-06 05:24:45,320 INFO L131 PetriNetUnfolder]: For 10037/10037 co-relation queries the response was YES. [2022-12-06 05:24:45,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24283 conditions, 7745 events. 5359/7745 cut-off events. For 10037/10037 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 38334 event pairs, 303 based on Foata normal form. 300/6774 useless extension candidates. Maximal degree in co-relation 24264. Up to 2531 conditions per place. [2022-12-06 05:24:45,367 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 426 selfloop transitions, 73 changer transitions 74/573 dead transitions. [2022-12-06 05:24:45,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 573 transitions, 3279 flow [2022-12-06 05:24:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 05:24:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 05:24:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 519 transitions. [2022-12-06 05:24:45,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083398898505114 [2022-12-06 05:24:45,370 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 145 flow. Second operand 41 states and 519 transitions. [2022-12-06 05:24:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 573 transitions, 3279 flow [2022-12-06 05:24:45,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 573 transitions, 3171 flow, removed 51 selfloop flow, removed 7 redundant places. [2022-12-06 05:24:45,413 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 852 flow [2022-12-06 05:24:45,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=852, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2022-12-06 05:24:45,415 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2022-12-06 05:24:45,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:45,415 INFO L89 Accepts]: Start accepts. Operand has 110 places, 103 transitions, 852 flow [2022-12-06 05:24:45,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:45,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:45,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 852 flow [2022-12-06 05:24:45,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 103 transitions, 852 flow [2022-12-06 05:24:45,512 INFO L130 PetriNetUnfolder]: 357/901 cut-off events. [2022-12-06 05:24:45,512 INFO L131 PetriNetUnfolder]: For 19538/19897 co-relation queries the response was YES. [2022-12-06 05:24:45,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 901 events. 357/901 cut-off events. For 19538/19897 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5786 event pairs, 60 based on Foata normal form. 13/684 useless extension candidates. Maximal degree in co-relation 4001. Up to 341 conditions per place. [2022-12-06 05:24:45,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 103 transitions, 852 flow [2022-12-06 05:24:45,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 1208 [2022-12-06 05:24:49,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse13 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= v_~q1_back~0_Out_28 v_~q1_back~0_In_11)) (.cse2 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_5| |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|)) (.cse4 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_5| 256) 0)) (.cse3 (not .cse13)) (.cse5 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_3| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|)) (.cse7 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|)) (.cse8 (= v_~q3_front~0_Out_20 v_~q3_front~0_In_10)) (.cse9 (= v_~r~0_In_7 v_~r~0_Out_20)) (.cse10 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_3| |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|)) (.cse12 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_3| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|))) (or (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= (select (select |v_#memory_int_In_37| v_~q3~0.base_In_10) (+ (* v_~q3_front~0_In_10 4) v_~q3~0.offset_In_10)) |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) .cse0 (= (ite (and (<= 0 v_~q3_front~0_In_10) (< v_~q3_front~0_In_10 v_~n3~0_In_9)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) .cse1 (= (+ v_~q3_front~0_In_10 1) v_~q3_front~0_Out_20) (= (+ v_~r~0_In_7 |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) v_~r~0_Out_20) .cse2 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0)) .cse3 (not .cse4) .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse3 .cse12 .cse5) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) .cse8 .cse9 (= v_~q1_back~0_Out_28 (+ 1 v_~q1_back~0_In_11)) .cse10 .cse11 .cse13 .cse12)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_3|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_3|, ~q3~0.offset=v_~q3~0.offset_In_10, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_3|, ~q3_front~0=v_~q3_front~0_In_10, ~q1_back~0=v_~q1_back~0_In_11, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_10|, ~q3~0.offset=v_~q3~0.offset_In_10, ~q3_front~0=v_~q3_front~0_Out_20, ~q1_back~0=v_~q1_back~0_Out_28, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, ~r~0=v_~r~0_Out_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1082] L149-4-->L150-3: Formula: (and (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre33#1_23|) (= (store |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_194| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre33#1_23|)) |v_#memory_int_193|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_194|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_17|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_9|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-06 05:24:50,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1127] L57-->L62-1: Formula: (let ((.cse13 (= 2 |v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_1|)) (.cse1 (= v_~q1_back~0_Out_28 v_~q1_back~0_In_11)) (.cse2 (= |v_thread1Thread1of1ForFork1_~i~0#1_In_5| |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|)) (.cse4 (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_5| 256) 0)) (.cse3 (not .cse13)) (.cse5 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_1|)) (.cse6 (= |v_thread1Thread1of1ForFork1_#t~mem4#1_In_3| |v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|)) (.cse7 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|)) (.cse8 (= v_~q3_front~0_Out_20 v_~q3_front~0_In_10)) (.cse9 (= v_~r~0_In_7 v_~r~0_Out_20)) (.cse10 (= |v_thread1Thread1of1ForFork1_~l~0#1_In_3| |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|)) (.cse12 (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_3| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|))) (or (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= (select (select |v_#memory_int_In_37| v_~q3~0.base_In_10) (+ (* v_~q3_front~0_In_10 4) v_~q3~0.offset_In_10)) |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) .cse0 (= (ite (and (<= 0 v_~q3_front~0_In_10) (< v_~q3_front~0_In_10 v_~n3~0_In_9)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) .cse1 (= (+ v_~q3_front~0_In_10 1) v_~q3_front~0_Out_20) (= (+ v_~r~0_In_7 |v_thread1Thread1of1ForFork1_~l~0#1_Out_10|) v_~r~0_Out_20) .cse2 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0)) .cse3 (not .cse4) .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse3 .cse12 .cse5) (and .cse6 .cse7 (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) .cse8 .cse9 (= v_~q1_back~0_Out_28 (+ 1 v_~q1_back~0_In_11)) .cse10 .cse11 .cse13 .cse12)))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_1|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_In_3|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_3|, ~q3~0.offset=v_~q3~0.offset_In_10, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_In_3|, ~q3_front~0=v_~q3_front~0_In_10, ~q1_back~0=v_~q1_back~0_In_11, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_5|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_In_1|, ~r~0=v_~r~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_4|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_8|, ~n3~0=v_~n3~0_In_9, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_8|, thread1Thread1of1ForFork1_~l~0#1=|v_thread1Thread1of1ForFork1_~l~0#1_Out_10|, ~q3~0.offset=v_~q3~0.offset_In_10, ~q3_front~0=v_~q3_front~0_Out_20, ~q1_back~0=v_~q1_back~0_Out_28, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, #memory_int=|v_#memory_int_In_37|, ~q3~0.base=v_~q3~0.base_In_10, ~r~0=v_~r~0_Out_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q3_front~0, thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~l~0#1, ~r~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] [2022-12-06 05:24:50,559 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:24:50,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5145 [2022-12-06 05:24:50,560 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 878 flow [2022-12-06 05:24:50,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:50,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:50,560 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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 05:24:50,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:24:50,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:50,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1181709745, now seen corresponding path program 1 times [2022-12-06 05:24:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946198647] [2022-12-06 05:24:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:24:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:51,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946198647] [2022-12-06 05:24:51,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946198647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:51,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753255703] [2022-12-06 05:24:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:51,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:51,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:51,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:24:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:51,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:24:51,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:51,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:51,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 238 [2022-12-06 05:24:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:51,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:58,510 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:24:58,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:58,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 9 [2022-12-06 05:24:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:58,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753255703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:58,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:58,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 7] total 19 [2022-12-06 05:24:58,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578559303] [2022-12-06 05:24:58,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:58,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:24:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:24:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-12-06 05:24:58,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:24:58,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 878 flow. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:58,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:58,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:24:58,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:11,712 WARN L233 SmtUtils]: Spent 12.46s on a formula simplification. DAG size of input: 66 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:25:28,049 WARN L233 SmtUtils]: Spent 16.16s on a formula simplification. DAG size of input: 69 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:25:44,262 WARN L233 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 65 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:26:00,639 WARN L233 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 68 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:26:17,640 WARN L233 SmtUtils]: Spent 16.19s on a formula simplification. DAG size of input: 68 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:26:34,411 WARN L233 SmtUtils]: Spent 16.29s on a formula simplification. DAG size of input: 67 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:26:34,913 INFO L130 PetriNetUnfolder]: 11061/15649 cut-off events. [2022-12-06 05:26:34,913 INFO L131 PetriNetUnfolder]: For 233479/233479 co-relation queries the response was YES. [2022-12-06 05:26:34,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72593 conditions, 15649 events. 11061/15649 cut-off events. For 233479/233479 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 84956 event pairs, 834 based on Foata normal form. 8/12544 useless extension candidates. Maximal degree in co-relation 72553. Up to 6213 conditions per place. [2022-12-06 05:26:34,975 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 0 selfloop transitions, 0 changer transitions 571/571 dead transitions. [2022-12-06 05:26:34,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 571 transitions, 6300 flow [2022-12-06 05:26:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 05:26:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 05:26:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 355 transitions. [2022-12-06 05:26:34,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3271889400921659 [2022-12-06 05:26:34,977 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 878 flow. Second operand 31 states and 355 transitions. [2022-12-06 05:26:34,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 571 transitions, 6300 flow [2022-12-06 05:26:35,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 571 transitions, 5815 flow, removed 232 selfloop flow, removed 5 redundant places. [2022-12-06 05:26:35,363 INFO L231 Difference]: Finished difference. Result has 131 places, 0 transitions, 0 flow [2022-12-06 05:26:35,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=0, PETRI_PLACES=131, PETRI_TRANSITIONS=0} [2022-12-06 05:26:35,364 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 96 predicate places. [2022-12-06 05:26:35,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:35,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 0 transitions, 0 flow [2022-12-06 05:26:35,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:26:35,364 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:26:35,364 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:26:35,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:26:35,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:26:35,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:26:35,365 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:35,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 05:26:35,365 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:26:35,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:35,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:26:35,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:26:35,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:26:35,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:26:35,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:26:35,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:35,573 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:35,575 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:26:35,575 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:26:35,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:26:35 BasicIcfg [2022-12-06 05:26:35,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:26:35,578 INFO L158 Benchmark]: Toolchain (without parser) took 131729.09ms. Allocated memory was 188.7MB in the beginning and 685.8MB in the end (delta: 497.0MB). Free memory was 166.0MB in the beginning and 302.3MB in the end (delta: -136.3MB). Peak memory consumption was 361.2MB. Max. memory is 8.0GB. [2022-12-06 05:26:35,578 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 166.6MB in the beginning and 166.5MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:26:35,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.29ms. Allocated memory is still 188.7MB. Free memory was 166.0MB in the beginning and 151.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 05:26:35,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 188.7MB. Free memory was 151.3MB in the beginning and 148.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:26:35,579 INFO L158 Benchmark]: Boogie Preprocessor took 59.77ms. Allocated memory is still 188.7MB. Free memory was 148.7MB in the beginning and 146.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:26:35,579 INFO L158 Benchmark]: RCFGBuilder took 650.01ms. Allocated memory is still 188.7MB. Free memory was 146.6MB in the beginning and 107.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 05:26:35,579 INFO L158 Benchmark]: TraceAbstraction took 130659.58ms. Allocated memory was 188.7MB in the beginning and 685.8MB in the end (delta: 497.0MB). Free memory was 106.7MB in the beginning and 302.3MB in the end (delta: -195.6MB). Peak memory consumption was 302.5MB. Max. memory is 8.0GB. [2022-12-06 05:26:35,581 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.12ms. Allocated memory is still 188.7MB. Free memory was 166.6MB in the beginning and 166.5MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.29ms. Allocated memory is still 188.7MB. Free memory was 166.0MB in the beginning and 151.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 188.7MB. Free memory was 151.3MB in the beginning and 148.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.77ms. Allocated memory is still 188.7MB. Free memory was 148.7MB in the beginning and 146.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 650.01ms. Allocated memory is still 188.7MB. Free memory was 146.6MB in the beginning and 107.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 130659.58ms. Allocated memory was 188.7MB in the beginning and 685.8MB in the end (delta: 497.0MB). Free memory was 106.7MB in the beginning and 302.3MB in the end (delta: -195.6MB). Peak memory consumption was 302.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 228 PlacesBefore, 35 PlacesAfterwards, 243 TransitionsBefore, 33 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 42 ConcurrentYvCompositions, 15 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 1968, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1998, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 2751, Positive cache size: 2736, Positive conditional cache size: 0, Positive unconditional cache size: 2736, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 22, unknown conditional: 2, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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: 1.4s, 35 PlacesBefore, 34 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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.3s, 37 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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.2s, 36 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 35 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 270 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: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 242 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: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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: 1.6s, 46 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 107 PlacesBefore, 107 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 188, independent conditional: 188, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 188, independent conditional: 158, independent unconditional: 30, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 242, independent: 188, independent conditional: 158, independent unconditional: 30, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 242, independent: 188, independent conditional: 158, independent unconditional: 30, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 25, independent unconditional: 2, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 116, dependent conditional: 116, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 242, independent: 161, independent conditional: 133, independent unconditional: 28, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 39, unknown conditional: 37, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 43, Positive conditional cache size: 27, Positive unconditional cache size: 16, Negative cache size: 19, Negative conditional cache size: 13, Negative unconditional cache size: 6, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 43, Positive conditional cache size: 27, Positive unconditional cache size: 16, Negative cache size: 19, Negative conditional cache size: 13, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 156]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 277 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 130.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 100.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2108 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2108 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2713 IncrementalHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 0 mSDtfsCounter, 2713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 101.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=8, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 399 ConstructedInterpolants, 2 QuantifiedInterpolants, 2744 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1555 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/35 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:26:35,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...