/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/pthread-wmm/safe018_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:30:21,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:30:21,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:30:21,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:30:21,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:30:21,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:30:21,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:30:21,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:30:21,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:30:21,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:30:21,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:30:21,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:30:21,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:30:21,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:30:21,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:30:21,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:30:21,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:30:21,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:30:21,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:30:21,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:30:21,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:30:21,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:30:21,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:30:21,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:30:21,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:30:21,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:30:21,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:30:21,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:30:21,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:30:21,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:30:21,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:30:21,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:30:21,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:30:21,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:30:21,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:30:21,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:30:21,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:30:21,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:30:21,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:30:21,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:30:21,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:30:21,663 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 04:30:21,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:30:21,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:30:21,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:30:21,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:30:21,690 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:30:21,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:30:21,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:30:21,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:30:21,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:30:21,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:30:21,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:30:21,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:21,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:30:21,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:30:21,694 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 04:30:21,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:30:21,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:30:21,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:30:21,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:30:21,995 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:30:21,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2022-12-06 04:30:23,139 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:30:23,376 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:30:23,377 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2022-12-06 04:30:23,391 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5e59003/2feb55882586498c880994633cff88ac/FLAGea5b4f235 [2022-12-06 04:30:23,410 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5e59003/2feb55882586498c880994633cff88ac [2022-12-06 04:30:23,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:30:23,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:30:23,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:23,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:30:23,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:30:23,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ebc002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23, skipping insertion in model container [2022-12-06 04:30:23,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:30:23,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:30:23,608 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-12-06 04:30:23,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:23,786 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:30:23,794 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-12-06 04:30:23,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:23,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:23,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:23,849 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:30:23,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23 WrapperNode [2022-12-06 04:30:23,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:23,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:23,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:30:23,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:30:23,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,885 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 04:30:23,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:23,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:30:23,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:30:23,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:30:23,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,916 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:30:23,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:30:23,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:30:23,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:30:23,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (1/1) ... [2022-12-06 04:30:23,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:30:23,959 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 04:30:23,965 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 04:30:23,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:30:23,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:30:23,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:30:23,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:30:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:30:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:30:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:30:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:30:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:30:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:30:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:30:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:30:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:30:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:30:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:30:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:30:23,993 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 04:30:24,112 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:30:24,113 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:30:24,426 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:30:24,573 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:30:24,574 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:30:24,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:24 BoogieIcfgContainer [2022-12-06 04:30:24,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:30:24,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:30:24,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:30:24,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:30:24,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:23" (1/3) ... [2022-12-06 04:30:24,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501f9316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:24, skipping insertion in model container [2022-12-06 04:30:24,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:23" (2/3) ... [2022-12-06 04:30:24,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501f9316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:24, skipping insertion in model container [2022-12-06 04:30:24,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:24" (3/3) ... [2022-12-06 04:30:24,583 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-12-06 04:30:24,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:30:24,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:30:24,600 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:30:24,679 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:30:24,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 04:30:24,770 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-12-06 04:30:24,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:24,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 04:30:24,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 04:30:24,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2022-12-06 04:30:24,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:24,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 04:30:24,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2022-12-06 04:30:24,843 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2022-12-06 04:30:24,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:24,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 04:30:24,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 04:30:24,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-06 04:30:31,481 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 04:30:31,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:30:31,498 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;@371253ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:30:31,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:30:31,503 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:30:31,503 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:31,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:31,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:31,504 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 04:30:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1729796226, now seen corresponding path program 1 times [2022-12-06 04:30:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:31,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727258973] [2022-12-06 04:30:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:31,687 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 04:30:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:31,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727258973] [2022-12-06 04:30:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727258973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:31,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:31,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159358361] [2022-12-06 04:30:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:31,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:30:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:31,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:30:31,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:30:31,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:30:31,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 47 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:31,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:31,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:30:31,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:31,825 INFO L130 PetriNetUnfolder]: 293/481 cut-off events. [2022-12-06 04:30:31,825 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:30:31,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 481 events. 293/481 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1896 event pairs, 293 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 963. Up to 463 conditions per place. [2022-12-06 04:30:31,829 INFO L137 encePairwiseOnDemand]: 18/19 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2022-12-06 04:30:31,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 18 transitions, 77 flow [2022-12-06 04:30:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:30:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:30:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 04:30:31,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 04:30:31,838 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 47 flow. Second operand 2 states and 21 transitions. [2022-12-06 04:30:31,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 18 transitions, 77 flow [2022-12-06 04:30:31,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:30:31,840 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 42 flow [2022-12-06 04:30:31,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-06 04:30:31,844 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 04:30:31,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:31,844 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 42 flow [2022-12-06 04:30:31,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:31,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:31,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 42 flow [2022-12-06 04:30:31,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 42 flow [2022-12-06 04:30:31,851 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:30:31,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:31,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:30:31,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 42 flow [2022-12-06 04:30:31,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 04:30:31,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:31,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 04:30:31,953 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 42 flow [2022-12-06 04:30:31,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:31,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:31,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:31,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:30:31,954 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 04:30:31,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash -181862396, now seen corresponding path program 1 times [2022-12-06 04:30:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383556407] [2022-12-06 04:30:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:32,243 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 04:30:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383556407] [2022-12-06 04:30:32,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383556407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:32,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:32,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569402532] [2022-12-06 04:30:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:32,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:32,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 04:30:32,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:30:32,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:32,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 04:30:32,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:32,331 INFO L130 PetriNetUnfolder]: 272/460 cut-off events. [2022-12-06 04:30:32,331 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:32,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 460 events. 272/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1841 event pairs, 74 based on Foata normal form. 9/468 useless extension candidates. Maximal degree in co-relation 912. Up to 325 conditions per place. [2022-12-06 04:30:32,337 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-06 04:30:32,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 98 flow [2022-12-06 04:30:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 04:30:32,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-06 04:30:32,338 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 29 transitions. [2022-12-06 04:30:32,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 98 flow [2022-12-06 04:30:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:30:32,340 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 50 flow [2022-12-06 04:30:32,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2022-12-06 04:30:32,341 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2022-12-06 04:30:32,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:32,341 INFO L89 Accepts]: Start accepts. Operand has 28 places, 18 transitions, 50 flow [2022-12-06 04:30:32,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:32,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:32,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 18 transitions, 50 flow [2022-12-06 04:30:32,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 50 flow [2022-12-06 04:30:32,347 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:30:32,347 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:32,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:30:32,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 18 transitions, 50 flow [2022-12-06 04:30:32,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:30:32,416 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:32,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 04:30:32,417 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 50 flow [2022-12-06 04:30:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:30:32,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:32,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:32,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:30:32,418 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 04:30:32,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1342766355, now seen corresponding path program 1 times [2022-12-06 04:30:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:32,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169064849] [2022-12-06 04:30:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:32,619 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 04:30:32,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:32,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169064849] [2022-12-06 04:30:32,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169064849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:32,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:32,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:30:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783953117] [2022-12-06 04:30:32,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:32,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:32,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:32,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:30:32,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:32,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:32,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:30:32,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:32,740 INFO L130 PetriNetUnfolder]: 465/766 cut-off events. [2022-12-06 04:30:32,740 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 04:30:32,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 766 events. 465/766 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3258 event pairs, 109 based on Foata normal form. 36/798 useless extension candidates. Maximal degree in co-relation 1628. Up to 324 conditions per place. [2022-12-06 04:30:32,743 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 27 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2022-12-06 04:30:32,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 161 flow [2022-12-06 04:30:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:30:32,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-06 04:30:32,744 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 50 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:30:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 161 flow [2022-12-06 04:30:32,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:32,746 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 60 flow [2022-12-06 04:30:32,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-12-06 04:30:32,746 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-06 04:30:32,746 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:32,746 INFO L89 Accepts]: Start accepts. Operand has 31 places, 18 transitions, 60 flow [2022-12-06 04:30:32,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:32,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:32,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 18 transitions, 60 flow [2022-12-06 04:30:32,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 18 transitions, 60 flow [2022-12-06 04:30:32,750 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:30:32,750 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 04:30:32,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 18 events. 0/18 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:30:32,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 18 transitions, 60 flow [2022-12-06 04:30:32,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:30:32,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:32,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:30:32,755 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2022-12-06 04:30:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:32,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:32,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:30:32,755 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 04:30:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1323832973, now seen corresponding path program 1 times [2022-12-06 04:30:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678814153] [2022-12-06 04:30:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:32,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:32,889 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 04:30:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678814153] [2022-12-06 04:30:32,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678814153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:32,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:32,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992393739] [2022-12-06 04:30:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:32,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 04:30:32,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:32,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:32,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 04:30:32,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:33,006 INFO L130 PetriNetUnfolder]: 175/320 cut-off events. [2022-12-06 04:30:33,006 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-06 04:30:33,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 320 events. 175/320 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1214 event pairs, 55 based on Foata normal form. 6/324 useless extension candidates. Maximal degree in co-relation 753. Up to 229 conditions per place. [2022-12-06 04:30:33,008 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 04:30:33,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 148 flow [2022-12-06 04:30:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:30:33,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 04:30:33,010 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:30:33,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 148 flow [2022-12-06 04:30:33,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 131 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:30:33,012 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 56 flow [2022-12-06 04:30:33,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2022-12-06 04:30:33,014 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2022-12-06 04:30:33,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:33,014 INFO L89 Accepts]: Start accepts. Operand has 30 places, 18 transitions, 56 flow [2022-12-06 04:30:33,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:33,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:33,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-06 04:30:33,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 56 flow [2022-12-06 04:30:33,022 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:30:33,023 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:30:33,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:30:33,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-06 04:30:33,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 04:30:33,025 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:33,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:30:33,029 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 56 flow [2022-12-06 04:30:33,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:33,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:33,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:33,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:30:33,030 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 04:30:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 891790460, now seen corresponding path program 1 times [2022-12-06 04:30:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:33,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431558680] [2022-12-06 04:30:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:34,063 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 04:30:34,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:34,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431558680] [2022-12-06 04:30:34,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431558680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:34,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:34,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:30:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30684131] [2022-12-06 04:30:34,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:34,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:30:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:30:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:30:34,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:30:34,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:34,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:34,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:30:34,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:34,198 INFO L130 PetriNetUnfolder]: 278/485 cut-off events. [2022-12-06 04:30:34,198 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-06 04:30:34,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 485 events. 278/485 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2019 event pairs, 75 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1152. Up to 202 conditions per place. [2022-12-06 04:30:34,201 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 28 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-06 04:30:34,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 172 flow [2022-12-06 04:30:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:30:34,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:30:34,202 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 56 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:30:34,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 172 flow [2022-12-06 04:30:34,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:34,204 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 90 flow [2022-12-06 04:30:34,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:30:34,204 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2022-12-06 04:30:34,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:34,205 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 90 flow [2022-12-06 04:30:34,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:34,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:34,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 90 flow [2022-12-06 04:30:34,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 90 flow [2022-12-06 04:30:34,210 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:30:34,211 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-06 04:30:34,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 39 events. 3/39 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 76. Up to 8 conditions per place. [2022-12-06 04:30:34,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 90 flow [2022-12-06 04:30:34,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:30:34,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:30:34,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:30:34,245 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 92 flow [2022-12-06 04:30:34,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:34,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:34,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:34,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:30:34,246 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 04:30:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1178684358, now seen corresponding path program 2 times [2022-12-06 04:30:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:34,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832467109] [2022-12-06 04:30:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:35,007 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 04:30:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832467109] [2022-12-06 04:30:35,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832467109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:35,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:35,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:30:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787140318] [2022-12-06 04:30:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:35,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:30:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:30:35,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:30:35,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:30:35,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 04:30:35,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:35,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:30:35,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:35,205 INFO L130 PetriNetUnfolder]: 270/473 cut-off events. [2022-12-06 04:30:35,205 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-06 04:30:35,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 473 events. 270/473 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2043 event pairs, 53 based on Foata normal form. 4/476 useless extension candidates. Maximal degree in co-relation 1253. Up to 214 conditions per place. [2022-12-06 04:30:35,208 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-06 04:30:35,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 198 flow [2022-12-06 04:30:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 04:30:35,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:30:35,209 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 92 flow. Second operand 4 states and 38 transitions. [2022-12-06 04:30:35,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 198 flow [2022-12-06 04:30:35,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:30:35,210 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 108 flow [2022-12-06 04:30:35,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 04:30:35,211 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 8 predicate places. [2022-12-06 04:30:35,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:35,211 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 108 flow [2022-12-06 04:30:35,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:35,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:35,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 108 flow [2022-12-06 04:30:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 108 flow [2022-12-06 04:30:35,217 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:30:35,217 INFO L131 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2022-12-06 04:30:35,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 39 events. 3/39 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 0 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 83. Up to 8 conditions per place. [2022-12-06 04:30:35,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 108 flow [2022-12-06 04:30:35,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:30:35,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:30:35,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 04:30:35,304 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 108 flow [2022-12-06 04:30:35,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 04:30:35,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:35,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:35,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:30:35,304 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 04:30:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1133084728, now seen corresponding path program 1 times [2022-12-06 04:30:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:35,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773624971] [2022-12-06 04:30:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:35,486 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 04:30:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:35,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773624971] [2022-12-06 04:30:35,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773624971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:35,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:35,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147080792] [2022-12-06 04:30:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:35,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:35,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:30:35,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:35,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:35,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:30:35,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:35,646 INFO L130 PetriNetUnfolder]: 196/360 cut-off events. [2022-12-06 04:30:35,647 INFO L131 PetriNetUnfolder]: For 447/447 co-relation queries the response was YES. [2022-12-06 04:30:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 360 events. 196/360 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1488 event pairs, 21 based on Foata normal form. 33/391 useless extension candidates. Maximal degree in co-relation 1077. Up to 152 conditions per place. [2022-12-06 04:30:35,649 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2022-12-06 04:30:35,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 332 flow [2022-12-06 04:30:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 04:30:35,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-06 04:30:35,651 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 108 flow. Second operand 4 states and 47 transitions. [2022-12-06 04:30:35,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 332 flow [2022-12-06 04:30:35,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:35,653 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 131 flow [2022-12-06 04:30:35,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:30:35,654 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2022-12-06 04:30:35,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:35,654 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 131 flow [2022-12-06 04:30:35,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:35,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:35,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 131 flow [2022-12-06 04:30:35,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 131 flow [2022-12-06 04:30:35,669 INFO L130 PetriNetUnfolder]: 24/82 cut-off events. [2022-12-06 04:30:35,669 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-12-06 04:30:35,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 82 events. 24/82 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 300 event pairs, 8 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 203. Up to 48 conditions per place. [2022-12-06 04:30:35,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 131 flow [2022-12-06 04:30:35,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 04:30:35,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:35,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:30:35,675 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 131 flow [2022-12-06 04:30:35,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:35,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:35,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:35,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:30:35,676 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 04:30:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash 189194982, now seen corresponding path program 1 times [2022-12-06 04:30:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:35,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442829085] [2022-12-06 04:30:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:35,817 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 04:30:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442829085] [2022-12-06 04:30:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442829085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:35,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:35,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:30:35,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907098540] [2022-12-06 04:30:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:35,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:30:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:30:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:30:35,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:30:35,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:35,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:35,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:30:35,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:35,960 INFO L130 PetriNetUnfolder]: 118/237 cut-off events. [2022-12-06 04:30:35,960 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2022-12-06 04:30:35,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 237 events. 118/237 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 888 event pairs, 10 based on Foata normal form. 23/258 useless extension candidates. Maximal degree in co-relation 851. Up to 98 conditions per place. [2022-12-06 04:30:35,963 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 45 selfloop transitions, 8 changer transitions 1/55 dead transitions. [2022-12-06 04:30:35,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 388 flow [2022-12-06 04:30:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:30:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:30:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 04:30:35,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 04:30:35,965 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 131 flow. Second operand 5 states and 55 transitions. [2022-12-06 04:30:35,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 388 flow [2022-12-06 04:30:35,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 378 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:35,967 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 171 flow [2022-12-06 04:30:35,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-12-06 04:30:35,968 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 14 predicate places. [2022-12-06 04:30:35,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:35,968 INFO L89 Accepts]: Start accepts. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 04:30:35,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:35,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:35,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 04:30:35,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 04:30:35,981 INFO L130 PetriNetUnfolder]: 14/64 cut-off events. [2022-12-06 04:30:35,981 INFO L131 PetriNetUnfolder]: For 79/93 co-relation queries the response was YES. [2022-12-06 04:30:35,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 64 events. 14/64 cut-off events. For 79/93 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 1 based on Foata normal form. 4/67 useless extension candidates. Maximal degree in co-relation 202. Up to 32 conditions per place. [2022-12-06 04:30:35,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 04:30:35,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:30:35,986 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:35,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:30:35,987 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 171 flow [2022-12-06 04:30:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:35,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:35,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:35,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:30:35,988 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 04:30:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash 695063832, now seen corresponding path program 1 times [2022-12-06 04:30:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:35,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457441456] [2022-12-06 04:30:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:36,116 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 04:30:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:36,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457441456] [2022-12-06 04:30:36,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457441456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:36,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:36,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:30:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153522702] [2022-12-06 04:30:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:36,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:30:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:30:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:30:36,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:30:36,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:36,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:36,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:30:36,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:36,202 INFO L130 PetriNetUnfolder]: 79/165 cut-off events. [2022-12-06 04:30:36,202 INFO L131 PetriNetUnfolder]: For 374/374 co-relation queries the response was YES. [2022-12-06 04:30:36,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 165 events. 79/165 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 566 event pairs, 10 based on Foata normal form. 8/171 useless extension candidates. Maximal degree in co-relation 681. Up to 69 conditions per place. [2022-12-06 04:30:36,203 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 35 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2022-12-06 04:30:36,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 370 flow [2022-12-06 04:30:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:30:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:30:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 04:30:36,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-06 04:30:36,204 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 171 flow. Second operand 6 states and 49 transitions. [2022-12-06 04:30:36,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 370 flow [2022-12-06 04:30:36,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 326 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 04:30:36,206 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 174 flow [2022-12-06 04:30:36,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 04:30:36,207 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2022-12-06 04:30:36,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:36,207 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 174 flow [2022-12-06 04:30:36,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:36,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:36,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 174 flow [2022-12-06 04:30:36,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 174 flow [2022-12-06 04:30:36,213 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-06 04:30:36,213 INFO L131 PetriNetUnfolder]: For 80/86 co-relation queries the response was YES. [2022-12-06 04:30:36,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 50 events. 11/50 cut-off events. For 80/86 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 153. Up to 17 conditions per place. [2022-12-06 04:30:36,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 174 flow [2022-12-06 04:30:36,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:30:36,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L780-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_13|) (= |v_P0Thread1of1ForFork0_#res.base_13| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [570] L836-3-->L847: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_170 256) 0))) (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_180 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_370 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse0 (select |v_#memory_int_523| |v_~#y~0.base_227|)) (.cse2 (not .cse4)) (.cse11 (and .cse10 .cse1)) (.cse7 (not .cse5)) (.cse8 (not .cse6))) (and (= (store |v_#memory_int_523| |v_~#y~0.base_227| (store .cse0 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite22#1_173|)) |v_#memory_int_522|) (= v_~y$w_buff0_used~0_370 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_371)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem20#1_224| |v_ULTIMATE.start_main_#t~mem20#1_222|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~ite22#1_173|) (or (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~mem20#1_222|) (= (select .cse0 |v_~#y~0.offset_227|) |v_ULTIMATE.start_main_#t~mem20#1_222|)) (and .cse7 .cse8 (= v_~y$w_buff1~0_205 |v_ULTIMATE.start_main_#t~ite21#1_217|) .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite21#1_219| |v_ULTIMATE.start_main_#t~ite21#1_217|) (= |v_ULTIMATE.start_main_#t~ite22#1_173| v_~y$w_buff0~0_185) .cse1 .cse2 .cse9))) (= v_~y$r_buff1_thd0~0_179 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_367 256) 0)) .cse8) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_169 256) 0)))) 0 v_~y$r_buff1_thd0~0_180)) (= v_~y$r_buff0_thd0~0_169 (ite .cse11 0 v_~y$r_buff0_thd0~0_170)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~y$w_buff1_used~0_367 (ite (or .cse11 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_368)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_224|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_185, #memory_int=|v_#memory_int_523|, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_219|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_77|, ~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~#y~0.base=|v_~#y~0.base_227|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_172|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_185, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, #memory_int=|v_#memory_int_522|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[|v_ULTIMATE.start_main_#t~ite21#1_217|, |v_ULTIMATE.start_main_#t~mem20#1_222|, |v_ULTIMATE.start_main_#t~ite22#1_173|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ite22#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:30:37,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L814-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [570] L836-3-->L847: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_170 256) 0))) (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_180 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_370 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse0 (select |v_#memory_int_523| |v_~#y~0.base_227|)) (.cse2 (not .cse4)) (.cse11 (and .cse10 .cse1)) (.cse7 (not .cse5)) (.cse8 (not .cse6))) (and (= (store |v_#memory_int_523| |v_~#y~0.base_227| (store .cse0 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite22#1_173|)) |v_#memory_int_522|) (= v_~y$w_buff0_used~0_370 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_371)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem20#1_224| |v_ULTIMATE.start_main_#t~mem20#1_222|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~ite22#1_173|) (or (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~mem20#1_222|) (= (select .cse0 |v_~#y~0.offset_227|) |v_ULTIMATE.start_main_#t~mem20#1_222|)) (and .cse7 .cse8 (= v_~y$w_buff1~0_205 |v_ULTIMATE.start_main_#t~ite21#1_217|) .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite21#1_219| |v_ULTIMATE.start_main_#t~ite21#1_217|) (= |v_ULTIMATE.start_main_#t~ite22#1_173| v_~y$w_buff0~0_185) .cse1 .cse2 .cse9))) (= v_~y$r_buff1_thd0~0_179 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_367 256) 0)) .cse8) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_169 256) 0)))) 0 v_~y$r_buff1_thd0~0_180)) (= v_~y$r_buff0_thd0~0_169 (ite .cse11 0 v_~y$r_buff0_thd0~0_170)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~y$w_buff1_used~0_367 (ite (or .cse11 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_368)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_224|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_185, #memory_int=|v_#memory_int_523|, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_219|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_77|, ~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~#y~0.base=|v_~#y~0.base_227|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_172|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_185, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, #memory_int=|v_#memory_int_522|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[|v_ULTIMATE.start_main_#t~ite21#1_217|, |v_ULTIMATE.start_main_#t~mem20#1_222|, |v_ULTIMATE.start_main_#t~ite22#1_173|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ite22#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:30:37,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] L792-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_17| 0) (= |v_P1Thread1of1ForFork1_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [570] L836-3-->L847: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_170 256) 0))) (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_180 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_370 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse0 (select |v_#memory_int_523| |v_~#y~0.base_227|)) (.cse2 (not .cse4)) (.cse11 (and .cse10 .cse1)) (.cse7 (not .cse5)) (.cse8 (not .cse6))) (and (= (store |v_#memory_int_523| |v_~#y~0.base_227| (store .cse0 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite22#1_173|)) |v_#memory_int_522|) (= v_~y$w_buff0_used~0_370 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_371)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem20#1_224| |v_ULTIMATE.start_main_#t~mem20#1_222|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~ite22#1_173|) (or (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~mem20#1_222|) (= (select .cse0 |v_~#y~0.offset_227|) |v_ULTIMATE.start_main_#t~mem20#1_222|)) (and .cse7 .cse8 (= v_~y$w_buff1~0_205 |v_ULTIMATE.start_main_#t~ite21#1_217|) .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite21#1_219| |v_ULTIMATE.start_main_#t~ite21#1_217|) (= |v_ULTIMATE.start_main_#t~ite22#1_173| v_~y$w_buff0~0_185) .cse1 .cse2 .cse9))) (= v_~y$r_buff1_thd0~0_179 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_367 256) 0)) .cse8) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_169 256) 0)))) 0 v_~y$r_buff1_thd0~0_180)) (= v_~y$r_buff0_thd0~0_169 (ite .cse11 0 v_~y$r_buff0_thd0~0_170)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~y$w_buff1_used~0_367 (ite (or .cse11 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_368)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_224|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_185, #memory_int=|v_#memory_int_523|, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_219|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_77|, ~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~#y~0.base=|v_~#y~0.base_227|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_172|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_185, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, #memory_int=|v_#memory_int_522|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[|v_ULTIMATE.start_main_#t~ite21#1_217|, |v_ULTIMATE.start_main_#t~mem20#1_222|, |v_ULTIMATE.start_main_#t~ite22#1_173|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ite22#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:30:40,205 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:30:40,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3999 [2022-12-06 04:30:40,206 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 168 flow [2022-12-06 04:30:40,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:40,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:40,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:40,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:30:40,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1477741865, now seen corresponding path program 1 times [2022-12-06 04:30:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:40,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294998886] [2022-12-06 04:30:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:40,363 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 04:30:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:40,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294998886] [2022-12-06 04:30:40,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294998886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:40,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:40,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383526410] [2022-12-06 04:30:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:40,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:40,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:30:40,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 168 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:40,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:40,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:30:40,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:40,437 INFO L130 PetriNetUnfolder]: 141/275 cut-off events. [2022-12-06 04:30:40,437 INFO L131 PetriNetUnfolder]: For 647/647 co-relation queries the response was YES. [2022-12-06 04:30:40,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 275 events. 141/275 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1088 event pairs, 22 based on Foata normal form. 3/278 useless extension candidates. Maximal degree in co-relation 1073. Up to 142 conditions per place. [2022-12-06 04:30:40,439 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 1 changer transitions 16/43 dead transitions. [2022-12-06 04:30:40,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 362 flow [2022-12-06 04:30:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 04:30:40,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-06 04:30:40,440 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 168 flow. Second operand 4 states and 35 transitions. [2022-12-06 04:30:40,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 362 flow [2022-12-06 04:30:40,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 280 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 04:30:40,442 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 115 flow [2022-12-06 04:30:40,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 04:30:40,443 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2022-12-06 04:30:40,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:40,443 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 115 flow [2022-12-06 04:30:40,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:40,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:40,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 115 flow [2022-12-06 04:30:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 115 flow [2022-12-06 04:30:40,451 INFO L130 PetriNetUnfolder]: 11/53 cut-off events. [2022-12-06 04:30:40,452 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-12-06 04:30:40,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 53 events. 11/53 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 166 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 120. Up to 12 conditions per place. [2022-12-06 04:30:40,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 115 flow [2022-12-06 04:30:40,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:30:42,811 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:30:42,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2369 [2022-12-06 04:30:42,812 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 119 flow [2022-12-06 04:30:42,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:42,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:42,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:42,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:30:42,813 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2092349930, now seen corresponding path program 1 times [2022-12-06 04:30:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:42,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723672943] [2022-12-06 04:30:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:30:42,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:30:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:30:43,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:30:43,000 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:30:43,001 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:30:43,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:30:43,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:30:43,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:30:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:30:43,003 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:43,009 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:30:43,009 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:30:43,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:30:43 BasicIcfg [2022-12-06 04:30:43,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:30:43,083 INFO L158 Benchmark]: Toolchain (without parser) took 19669.80ms. Allocated memory was 185.6MB in the beginning and 477.1MB in the end (delta: 291.5MB). Free memory was 160.8MB in the beginning and 430.6MB in the end (delta: -269.8MB). Peak memory consumption was 286.0MB. Max. memory is 8.0GB. [2022-12-06 04:30:43,083 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:30:43,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.17ms. Allocated memory is still 185.6MB. Free memory was 160.3MB in the beginning and 135.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:30:43,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.37ms. Allocated memory is still 185.6MB. Free memory was 135.0MB in the beginning and 132.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:43,084 INFO L158 Benchmark]: Boogie Preprocessor took 49.35ms. Allocated memory is still 185.6MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:43,084 INFO L158 Benchmark]: RCFGBuilder took 639.09ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 130.4MB in the beginning and 198.4MB in the end (delta: -68.0MB). Peak memory consumption was 47.9MB. Max. memory is 8.0GB. [2022-12-06 04:30:43,084 INFO L158 Benchmark]: TraceAbstraction took 18505.89ms. Allocated memory was 226.5MB in the beginning and 477.1MB in the end (delta: 250.6MB). Free memory was 197.4MB in the beginning and 430.6MB in the end (delta: -233.2MB). Peak memory consumption was 280.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:43,085 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.09ms. Allocated memory is still 185.6MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.17ms. Allocated memory is still 185.6MB. Free memory was 160.3MB in the beginning and 135.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.37ms. Allocated memory is still 185.6MB. Free memory was 135.0MB in the beginning and 132.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.35ms. Allocated memory is still 185.6MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 639.09ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 130.4MB in the beginning and 198.4MB in the end (delta: -68.0MB). Peak memory consumption was 47.9MB. Max. memory is 8.0GB. * TraceAbstraction took 18505.89ms. Allocated memory was 226.5MB in the beginning and 477.1MB in the end (delta: 250.6MB). Free memory was 197.4MB in the beginning and 430.6MB in the end (delta: -233.2MB). Peak memory consumption was 280.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 117 PlacesBefore, 28 PlacesAfterwards, 108 TransitionsBefore, 19 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 765, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 690, independent: 657, independent conditional: 0, independent unconditional: 657, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 690, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 806, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 690, unknown conditional: 0, unknown unconditional: 690] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 977, Positive conditional cache size: 0, Positive unconditional cache size: 977, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 31 PlacesBefore, 31 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 80, independent conditional: 34, independent unconditional: 46, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 80, independent conditional: 29, independent unconditional: 51, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 80, independent conditional: 29, independent unconditional: 51, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 74, independent conditional: 25, independent unconditional: 49, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 43, Positive conditional cache size: 4, Positive unconditional cache size: 39, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 120, independent: 96, independent conditional: 36, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 96, independent conditional: 26, independent unconditional: 70, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 96, independent conditional: 26, independent unconditional: 70, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 4, independent unconditional: 10, 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: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 82, independent conditional: 22, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 14, unknown conditional: 4, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 57, Positive conditional cache size: 8, Positive unconditional cache size: 49, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 26, independent conditional: 12, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 12, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 68, Positive conditional cache size: 15, Positive unconditional cache size: 53, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 15, independent unconditional: 10, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 25, independent conditional: 10, independent unconditional: 15, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 10, independent unconditional: 15, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 24, independent conditional: 9, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 69, Positive conditional cache size: 16, Positive unconditional cache size: 53, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 43 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 82, Positive conditional cache size: 21, Positive unconditional cache size: 61, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 36 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 104, Positive conditional cache size: 27, Positive unconditional cache size: 77, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=9, t2213={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t2214; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=10, t2213={7:0}, t2214={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t2215; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 __unbuffered_p0_EBX = x [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=11, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 3 __unbuffered_p2_EAX = x [L806] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L840] RET 2 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 2 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 2 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 2 \read(y) [L842] EXPR 2 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 2 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 2 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 2 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 2 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 2 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 2 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 2 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 2 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 2 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 2 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 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: 18.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 1 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=9, InterpolantAutomatonStates: 39, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:30:43,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...