/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:21:50,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:21:50,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:21:50,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:21:50,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:21:50,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:21:50,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:21:50,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:21:50,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:21:50,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:21:50,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:21:50,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:21:50,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:21:50,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:21:50,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:21:50,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:21:50,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:21:50,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:21:50,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:21:50,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:21:50,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:21:50,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:21:50,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:21:50,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:21:50,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:21:50,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:21:50,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:21:50,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:21:50,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:21:50,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:21:50,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:21:50,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:21:50,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:21:50,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:21:50,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:21:50,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:21:50,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:21:50,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:21:50,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:21:50,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:21:50,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:21:50,548 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:21:50,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:21:50,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:21:50,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:21:50,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:21:50,577 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:21:50,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:21:50,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:21:50,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:21:50,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:21:50,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:21:50,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:21:50,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:21:50,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:50,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:21:50,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:21:50,581 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 06:21:50,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:21:50,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:21:50,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:21:50,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:21:50,959 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:21:50,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:21:52,039 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:21:52,292 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:21:52,293 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:21:52,307 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35fe32e67/6de8d8d5bdd54787b65cb8b0b013b383/FLAG152078c29 [2022-12-06 06:21:52,326 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35fe32e67/6de8d8d5bdd54787b65cb8b0b013b383 [2022-12-06 06:21:52,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:21:52,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:21:52,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:52,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:21:52,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:21:52,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8ac3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52, skipping insertion in model container [2022-12-06 06:21:52,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:21:52,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:21:52,555 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:21:52,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:52,763 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:21:52,774 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:21:52,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:52,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:52,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:52,875 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:21:52,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52 WrapperNode [2022-12-06 06:21:52,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:52,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:52,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:21:52,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:21:52,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,967 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 06:21:52,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:52,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:21:52,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:21:52,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:21:52,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:52,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:53,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:53,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:53,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:21:53,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:21:53,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:21:53,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:21:53,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (1/1) ... [2022-12-06 06:21:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:53,043 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 06:21:53,062 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 06:21:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:21:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:21:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:21:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:21:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:21:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:21:53,077 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 06:21:53,259 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:21:53,260 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:21:53,517 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:21:53,611 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:21:53,611 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:21:53,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:53 BoogieIcfgContainer [2022-12-06 06:21:53,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:21:53,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:21:53,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:21:53,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:21:53,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:21:52" (1/3) ... [2022-12-06 06:21:53,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e8778e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:53, skipping insertion in model container [2022-12-06 06:21:53,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:52" (2/3) ... [2022-12-06 06:21:53,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e8778e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:53, skipping insertion in model container [2022-12-06 06:21:53,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:53" (3/3) ... [2022-12-06 06:21:53,619 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:21:53,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:21:53,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:21:53,634 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:21:53,684 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:21:53,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:21:53,792 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:21:53,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:53,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 06:21:53,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:21:53,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:53,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:53,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:53,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:53,849 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:21:53,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:53,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 06:21:53,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:53,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-06 06:21:57,524 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:21:57,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:21:57,547 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;@51292b2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:21:57,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:21:57,549 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:21:57,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:57,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:57,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:21:57,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:21:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash 466854, now seen corresponding path program 1 times [2022-12-06 06:21:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759487827] [2022-12-06 06:21:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:57,859 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 06:21:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:57,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759487827] [2022-12-06 06:21:57,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759487827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:57,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:57,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:21:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394425109] [2022-12-06 06:21:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:57,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:21:57,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:57,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:21:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:21:57,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:21:57,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:57,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:57,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:21:57,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:58,198 INFO L130 PetriNetUnfolder]: 1290/1952 cut-off events. [2022-12-06 06:21:58,199 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:21:58,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 1952 events. 1290/1952 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9106 event pairs, 569 based on Foata normal form. 0/1763 useless extension candidates. Maximal degree in co-relation 3899. Up to 1549 conditions per place. [2022-12-06 06:21:58,209 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 2 changer transitions 8/46 dead transitions. [2022-12-06 06:21:58,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 193 flow [2022-12-06 06:21:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:21:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:21:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 06:21:58,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 06:21:58,219 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 57 transitions. [2022-12-06 06:21:58,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 193 flow [2022-12-06 06:21:58,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:21:58,223 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 56 flow [2022-12-06 06:21:58,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 06:21:58,226 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 06:21:58,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:58,227 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 56 flow [2022-12-06 06:21:58,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:58,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:58,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 56 flow [2022-12-06 06:21:58,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2022-12-06 06:21:58,234 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:21:58,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:58,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:21:58,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2022-12-06 06:21:58,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 06:21:58,368 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:21:58,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 06:21:58,370 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 06:21:58,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:58,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:58,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:21:58,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:21:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash -275220846, now seen corresponding path program 1 times [2022-12-06 06:21:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:58,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091849285] [2022-12-06 06:21:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:58,556 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 06:21:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:58,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091849285] [2022-12-06 06:21:58,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091849285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:58,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:58,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:21:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736534659] [2022-12-06 06:21:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:58,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:21:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:58,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:21:58,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:21:58,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:21:58,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 06:21:58,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:58,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:21:58,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:58,892 INFO L130 PetriNetUnfolder]: 2172/3266 cut-off events. [2022-12-06 06:21:58,892 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-12-06 06:21:58,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6795 conditions, 3266 events. 2172/3266 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15857 event pairs, 738 based on Foata normal form. 128/3394 useless extension candidates. Maximal degree in co-relation 6785. Up to 1779 conditions per place. [2022-12-06 06:21:58,909 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 32 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2022-12-06 06:21:58,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 170 flow [2022-12-06 06:21:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:21:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:21:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 06:21:58,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 06:21:58,911 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 40 transitions. [2022-12-06 06:21:58,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 170 flow [2022-12-06 06:21:58,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:58,912 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2022-12-06 06:21:58,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 06:21:58,913 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2022-12-06 06:21:58,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:58,913 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 104 flow [2022-12-06 06:21:58,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:58,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:58,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 104 flow [2022-12-06 06:21:58,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 104 flow [2022-12-06 06:21:58,939 INFO L130 PetriNetUnfolder]: 74/240 cut-off events. [2022-12-06 06:21:58,939 INFO L131 PetriNetUnfolder]: For 35/38 co-relation queries the response was YES. [2022-12-06 06:21:58,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 240 events. 74/240 cut-off events. For 35/38 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1381 event pairs, 28 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 455. Up to 93 conditions per place. [2022-12-06 06:21:58,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 104 flow [2022-12-06 06:21:58,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 06:21:58,967 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:58,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:21:58,969 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2022-12-06 06:21:58,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 06:21:58,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:58,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:58,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:21:58,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:21:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 58086180, now seen corresponding path program 1 times [2022-12-06 06:21:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956486409] [2022-12-06 06:21:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:59,096 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 06:21:59,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:59,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956486409] [2022-12-06 06:21:59,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956486409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:59,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:59,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:21:59,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310113878] [2022-12-06 06:21:59,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:59,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:21:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:21:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:21:59,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:21:59,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 06:21:59,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:59,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:21:59,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:59,430 INFO L130 PetriNetUnfolder]: 2131/3202 cut-off events. [2022-12-06 06:21:59,431 INFO L131 PetriNetUnfolder]: For 1298/1298 co-relation queries the response was YES. [2022-12-06 06:21:59,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8179 conditions, 3202 events. 2131/3202 cut-off events. For 1298/1298 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15409 event pairs, 171 based on Foata normal form. 5/3207 useless extension candidates. Maximal degree in co-relation 8167. Up to 1688 conditions per place. [2022-12-06 06:21:59,446 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 39 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2022-12-06 06:21:59,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 270 flow [2022-12-06 06:21:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:21:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:21:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:21:59,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 06:21:59,447 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:21:59,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 270 flow [2022-12-06 06:21:59,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:59,452 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 162 flow [2022-12-06 06:21:59,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-06 06:21:59,453 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-06 06:21:59,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:59,453 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 162 flow [2022-12-06 06:21:59,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:59,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:59,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 162 flow [2022-12-06 06:21:59,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 162 flow [2022-12-06 06:21:59,469 INFO L130 PetriNetUnfolder]: 67/222 cut-off events. [2022-12-06 06:21:59,469 INFO L131 PetriNetUnfolder]: For 123/135 co-relation queries the response was YES. [2022-12-06 06:21:59,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 222 events. 67/222 cut-off events. For 123/135 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1209 event pairs, 19 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 508. Up to 86 conditions per place. [2022-12-06 06:21:59,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 162 flow [2022-12-06 06:21:59,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 06:21:59,473 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:59,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:21:59,474 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 162 flow [2022-12-06 06:21:59,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 06:21:59,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:59,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:59,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:21:59,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:21:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 58088691, now seen corresponding path program 1 times [2022-12-06 06:21:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:59,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281594378] [2022-12-06 06:21:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:59,556 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 06:21:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281594378] [2022-12-06 06:21:59,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281594378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:59,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:59,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:21:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371000517] [2022-12-06 06:21:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:59,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:21:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:21:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:21:59,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:21:59,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 162 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 06:21:59,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:59,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:21:59,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:59,870 INFO L130 PetriNetUnfolder]: 2081/3127 cut-off events. [2022-12-06 06:21:59,870 INFO L131 PetriNetUnfolder]: For 2546/2546 co-relation queries the response was YES. [2022-12-06 06:21:59,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8687 conditions, 3127 events. 2081/3127 cut-off events. For 2546/2546 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15037 event pairs, 283 based on Foata normal form. 10/3137 useless extension candidates. Maximal degree in co-relation 8672. Up to 1629 conditions per place. [2022-12-06 06:21:59,882 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 45 selfloop transitions, 15 changer transitions 0/60 dead transitions. [2022-12-06 06:21:59,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 366 flow [2022-12-06 06:21:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:21:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:21:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 06:21:59,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-06 06:21:59,885 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 162 flow. Second operand 4 states and 54 transitions. [2022-12-06 06:21:59,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 366 flow [2022-12-06 06:21:59,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:21:59,894 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 247 flow [2022-12-06 06:21:59,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 06:21:59,895 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-06 06:21:59,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:59,895 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 247 flow [2022-12-06 06:21:59,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:59,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:59,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 247 flow [2022-12-06 06:21:59,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 247 flow [2022-12-06 06:21:59,910 INFO L130 PetriNetUnfolder]: 57/198 cut-off events. [2022-12-06 06:21:59,911 INFO L131 PetriNetUnfolder]: For 353/380 co-relation queries the response was YES. [2022-12-06 06:21:59,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 198 events. 57/198 cut-off events. For 353/380 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1070 event pairs, 10 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 565. Up to 73 conditions per place. [2022-12-06 06:21:59,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 247 flow [2022-12-06 06:21:59,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 06:21:59,937 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:59,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:21:59,943 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 247 flow [2022-12-06 06:21:59,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 06:21:59,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:59,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:21:59,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:21:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1800671905, now seen corresponding path program 1 times [2022-12-06 06:21:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:59,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304980475] [2022-12-06 06:21:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:00,035 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 06:22:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:00,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304980475] [2022-12-06 06:22:00,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304980475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:00,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:00,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:22:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68641184] [2022-12-06 06:22:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:00,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:22:00,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 247 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 06:22:00,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:00,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:22:00,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:00,310 INFO L130 PetriNetUnfolder]: 1630/2560 cut-off events. [2022-12-06 06:22:00,311 INFO L131 PetriNetUnfolder]: For 4089/4178 co-relation queries the response was YES. [2022-12-06 06:22:00,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7675 conditions, 2560 events. 1630/2560 cut-off events. For 4089/4178 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12804 event pairs, 479 based on Foata normal form. 72/2611 useless extension candidates. Maximal degree in co-relation 7656. Up to 1842 conditions per place. [2022-12-06 06:22:00,324 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 36 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 06:22:00,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 363 flow [2022-12-06 06:22:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:22:00,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 06:22:00,328 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 247 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:22:00,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 363 flow [2022-12-06 06:22:00,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 361 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:22:00,337 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 256 flow [2022-12-06 06:22:00,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-06 06:22:00,339 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2022-12-06 06:22:00,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:00,339 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 256 flow [2022-12-06 06:22:00,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:00,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:00,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 256 flow [2022-12-06 06:22:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 256 flow [2022-12-06 06:22:00,353 INFO L130 PetriNetUnfolder]: 45/162 cut-off events. [2022-12-06 06:22:00,353 INFO L131 PetriNetUnfolder]: For 309/319 co-relation queries the response was YES. [2022-12-06 06:22:00,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 162 events. 45/162 cut-off events. For 309/319 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 793 event pairs, 5 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 501. Up to 59 conditions per place. [2022-12-06 06:22:00,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 256 flow [2022-12-06 06:22:00,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 06:22:00,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:00,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:22:00,360 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 256 flow [2022-12-06 06:22:00,360 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 06:22:00,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:00,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:22:00,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash 567370387, now seen corresponding path program 1 times [2022-12-06 06:22:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:00,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066103273] [2022-12-06 06:22:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:00,488 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 06:22:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066103273] [2022-12-06 06:22:00,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066103273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:00,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:00,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528813891] [2022-12-06 06:22:00,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:00,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 06:22:00,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 06:22:00,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:00,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 06:22:00,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:00,728 INFO L130 PetriNetUnfolder]: 1086/1882 cut-off events. [2022-12-06 06:22:00,728 INFO L131 PetriNetUnfolder]: For 2774/2884 co-relation queries the response was YES. [2022-12-06 06:22:00,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5593 conditions, 1882 events. 1086/1882 cut-off events. For 2774/2884 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10569 event pairs, 163 based on Foata normal form. 232/2102 useless extension candidates. Maximal degree in co-relation 5571. Up to 1015 conditions per place. [2022-12-06 06:22:00,736 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 71 selfloop transitions, 8 changer transitions 3/93 dead transitions. [2022-12-06 06:22:00,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 727 flow [2022-12-06 06:22:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 06:22:00,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2022-12-06 06:22:00,738 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 256 flow. Second operand 5 states and 71 transitions. [2022-12-06 06:22:00,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 727 flow [2022-12-06 06:22:00,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 93 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:00,744 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 310 flow [2022-12-06 06:22:00,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 06:22:00,745 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-06 06:22:00,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:00,745 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 310 flow [2022-12-06 06:22:00,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:00,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:00,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 310 flow [2022-12-06 06:22:00,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 310 flow [2022-12-06 06:22:00,789 INFO L130 PetriNetUnfolder]: 151/413 cut-off events. [2022-12-06 06:22:00,790 INFO L131 PetriNetUnfolder]: For 603/705 co-relation queries the response was YES. [2022-12-06 06:22:00,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 413 events. 151/413 cut-off events. For 603/705 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 2766 event pairs, 48 based on Foata normal form. 12/393 useless extension candidates. Maximal degree in co-relation 1281. Up to 204 conditions per place. [2022-12-06 06:22:00,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 310 flow [2022-12-06 06:22:00,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-06 06:22:00,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [436] L841-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_42 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_149 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_31| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19| (mod v_~main$tmp_guard0~0_42 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [446] L819-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_17| 0) (= v_~__unbuffered_cnt~0_163 (+ v_~__unbuffered_cnt~0_164 1)) (= |v_P2Thread1of1ForFork1_#res.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_164} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-06 06:22:00,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [436] L841-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_42 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_149 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_31| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19| (mod v_~main$tmp_guard0~0_42 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [418] L783-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= |v_P1Thread1of1ForFork0_#res.offset_23| 0) (= |v_P1Thread1of1ForFork0_#res.base_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_23|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_23|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 06:22:00,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [436] L841-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_42 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_149 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_31| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19| (mod v_~main$tmp_guard0~0_42 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [383] L763-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork2_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_7|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 06:22:00,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:00,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 06:22:00,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 316 flow [2022-12-06 06:22:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 06:22:00,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:00,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:00,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:22:00,908 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1964305409, now seen corresponding path program 1 times [2022-12-06 06:22:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:00,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322391164] [2022-12-06 06:22:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:01,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 06:22:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:01,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322391164] [2022-12-06 06:22:01,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322391164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:01,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:01,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701525252] [2022-12-06 06:22:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:01,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:01,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:01,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:01,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:22:01,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:01,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:01,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:22:01,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:01,229 INFO L130 PetriNetUnfolder]: 650/1224 cut-off events. [2022-12-06 06:22:01,229 INFO L131 PetriNetUnfolder]: For 2533/2591 co-relation queries the response was YES. [2022-12-06 06:22:01,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4610 conditions, 1224 events. 650/1224 cut-off events. For 2533/2591 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6824 event pairs, 93 based on Foata normal form. 128/1342 useless extension candidates. Maximal degree in co-relation 4585. Up to 468 conditions per place. [2022-12-06 06:22:01,247 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 66 selfloop transitions, 14 changer transitions 13/104 dead transitions. [2022-12-06 06:22:01,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 104 transitions, 852 flow [2022-12-06 06:22:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:22:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:22:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 06:22:01,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2022-12-06 06:22:01,250 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 316 flow. Second operand 6 states and 89 transitions. [2022-12-06 06:22:01,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 104 transitions, 852 flow [2022-12-06 06:22:01,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 104 transitions, 842 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:01,254 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 403 flow [2022-12-06 06:22:01,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-06 06:22:01,255 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-06 06:22:01,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:01,255 INFO L89 Accepts]: Start accepts. Operand has 56 places, 51 transitions, 403 flow [2022-12-06 06:22:01,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:01,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:01,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 51 transitions, 403 flow [2022-12-06 06:22:01,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 403 flow [2022-12-06 06:22:01,281 INFO L130 PetriNetUnfolder]: 88/304 cut-off events. [2022-12-06 06:22:01,282 INFO L131 PetriNetUnfolder]: For 978/1114 co-relation queries the response was YES. [2022-12-06 06:22:01,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 304 events. 88/304 cut-off events. For 978/1114 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1911 event pairs, 6 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 1235. Up to 181 conditions per place. [2022-12-06 06:22:01,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 51 transitions, 403 flow [2022-12-06 06:22:01,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-06 06:22:01,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:01,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 06:22:01,337 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 395 flow [2022-12-06 06:22:01,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:01,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:01,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:22:01,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1547506178, now seen corresponding path program 1 times [2022-12-06 06:22:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:01,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083589011] [2022-12-06 06:22:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:01,524 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 06:22:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:01,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083589011] [2022-12-06 06:22:01,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083589011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:01,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:01,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922832145] [2022-12-06 06:22:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:01,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:22:01,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 395 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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 06:22:01,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:01,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:22:01,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:01,749 INFO L130 PetriNetUnfolder]: 1002/1764 cut-off events. [2022-12-06 06:22:01,749 INFO L131 PetriNetUnfolder]: For 7007/7007 co-relation queries the response was YES. [2022-12-06 06:22:01,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7625 conditions, 1764 events. 1002/1764 cut-off events. For 7007/7007 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9507 event pairs, 167 based on Foata normal form. 10/1774 useless extension candidates. Maximal degree in co-relation 7596. Up to 797 conditions per place. [2022-12-06 06:22:01,755 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 55 selfloop transitions, 14 changer transitions 34/103 dead transitions. [2022-12-06 06:22:01,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 989 flow [2022-12-06 06:22:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:22:01,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 06:22:01,757 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 395 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:22:01,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 989 flow [2022-12-06 06:22:01,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 103 transitions, 859 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:01,770 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 355 flow [2022-12-06 06:22:01,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2022-12-06 06:22:01,772 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-06 06:22:01,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:01,772 INFO L89 Accepts]: Start accepts. Operand has 58 places, 42 transitions, 355 flow [2022-12-06 06:22:01,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:01,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:01,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 42 transitions, 355 flow [2022-12-06 06:22:01,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 355 flow [2022-12-06 06:22:01,791 INFO L130 PetriNetUnfolder]: 71/258 cut-off events. [2022-12-06 06:22:01,791 INFO L131 PetriNetUnfolder]: For 620/625 co-relation queries the response was YES. [2022-12-06 06:22:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 258 events. 71/258 cut-off events. For 620/625 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1479 event pairs, 10 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 917. Up to 90 conditions per place. [2022-12-06 06:22:01,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 355 flow [2022-12-06 06:22:01,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 06:22:01,795 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:01,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:22:01,796 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 355 flow [2022-12-06 06:22:01,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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 06:22:01,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:01,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:01,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:22:01,797 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2147026567, now seen corresponding path program 1 times [2022-12-06 06:22:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:01,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687384686] [2022-12-06 06:22:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:01,963 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 06:22:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687384686] [2022-12-06 06:22:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687384686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:01,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:01,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:22:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870395918] [2022-12-06 06:22:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:01,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 06:22:01,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 06:22:01,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:01,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 06:22:01,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:02,135 INFO L130 PetriNetUnfolder]: 407/814 cut-off events. [2022-12-06 06:22:02,135 INFO L131 PetriNetUnfolder]: For 1974/2009 co-relation queries the response was YES. [2022-12-06 06:22:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3187 conditions, 814 events. 407/814 cut-off events. For 1974/2009 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4347 event pairs, 102 based on Foata normal form. 53/859 useless extension candidates. Maximal degree in co-relation 3157. Up to 289 conditions per place. [2022-12-06 06:22:02,138 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 44 selfloop transitions, 11 changer transitions 24/86 dead transitions. [2022-12-06 06:22:02,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 825 flow [2022-12-06 06:22:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:22:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:22:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 06:22:02,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.512987012987013 [2022-12-06 06:22:02,140 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 355 flow. Second operand 7 states and 79 transitions. [2022-12-06 06:22:02,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 825 flow [2022-12-06 06:22:02,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 722 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 06:22:02,144 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 300 flow [2022-12-06 06:22:02,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2022-12-06 06:22:02,145 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-06 06:22:02,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:02,145 INFO L89 Accepts]: Start accepts. Operand has 58 places, 39 transitions, 300 flow [2022-12-06 06:22:02,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:02,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:02,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 39 transitions, 300 flow [2022-12-06 06:22:02,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 39 transitions, 300 flow [2022-12-06 06:22:02,158 INFO L130 PetriNetUnfolder]: 23/102 cut-off events. [2022-12-06 06:22:02,158 INFO L131 PetriNetUnfolder]: For 245/249 co-relation queries the response was YES. [2022-12-06 06:22:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 102 events. 23/102 cut-off events. For 245/249 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 384 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 384. Up to 33 conditions per place. [2022-12-06 06:22:02,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 39 transitions, 300 flow [2022-12-06 06:22:02,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:22:02,512 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:22:02,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-06 06:22:02,513 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 286 flow [2022-12-06 06:22:02,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 06:22:02,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:02,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:02,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:22:02,514 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash -552212314, now seen corresponding path program 1 times [2022-12-06 06:22:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:02,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916488037] [2022-12-06 06:22:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:02,978 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 06:22:02,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:02,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916488037] [2022-12-06 06:22:02,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916488037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:02,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:02,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:22:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644216305] [2022-12-06 06:22:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:02,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:22:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:22:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:22:02,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 06:22:02,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 06:22:02,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:02,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 06:22:02,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:03,163 INFO L130 PetriNetUnfolder]: 235/460 cut-off events. [2022-12-06 06:22:03,164 INFO L131 PetriNetUnfolder]: For 1079/1091 co-relation queries the response was YES. [2022-12-06 06:22:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 460 events. 235/460 cut-off events. For 1079/1091 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2142 event pairs, 17 based on Foata normal form. 8/465 useless extension candidates. Maximal degree in co-relation 1901. Up to 237 conditions per place. [2022-12-06 06:22:03,167 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 45 selfloop transitions, 4 changer transitions 18/74 dead transitions. [2022-12-06 06:22:03,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 662 flow [2022-12-06 06:22:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:22:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:22:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 06:22:03,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-06 06:22:03,168 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 286 flow. Second operand 6 states and 61 transitions. [2022-12-06 06:22:03,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 662 flow [2022-12-06 06:22:03,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 571 flow, removed 15 selfloop flow, removed 9 redundant places. [2022-12-06 06:22:03,172 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 251 flow [2022-12-06 06:22:03,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2022-12-06 06:22:03,173 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2022-12-06 06:22:03,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:03,173 INFO L89 Accepts]: Start accepts. Operand has 51 places, 36 transitions, 251 flow [2022-12-06 06:22:03,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:03,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:03,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 36 transitions, 251 flow [2022-12-06 06:22:03,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 251 flow [2022-12-06 06:22:03,186 INFO L130 PetriNetUnfolder]: 24/96 cut-off events. [2022-12-06 06:22:03,186 INFO L131 PetriNetUnfolder]: For 199/207 co-relation queries the response was YES. [2022-12-06 06:22:03,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 96 events. 24/96 cut-off events. For 199/207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 377 event pairs, 0 based on Foata normal form. 6/102 useless extension candidates. Maximal degree in co-relation 295. Up to 24 conditions per place. [2022-12-06 06:22:03,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 251 flow [2022-12-06 06:22:03,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 06:22:03,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] L756-->P0EXIT: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd1~0_219 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_593 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd1~0_148 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~z$w_buff1_used~0_521 256))) .cse2)) (.cse4 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_594 256) 0))))) (and (= v_~__unbuffered_cnt~0_227 (+ v_~__unbuffered_cnt~0_228 1)) (= (ite .cse0 v_~z$w_buff0~0_355 (ite .cse1 v_~z$w_buff1~0_295 v_~z~0_448)) v_~z~0_447) (= v_~z$r_buff1_thd1~0_147 (ite (or (and .cse2 (not (= (mod v_~z$w_buff1_used~0_520 256) 0))) (and .cse3 (not (= (mod v_~z$r_buff0_thd1~0_218 256) 0)))) 0 v_~z$r_buff1_thd1~0_148)) (= v_~z$w_buff1_used~0_520 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_521)) (= |v_P0Thread1of1ForFork2_#res#1.base_29| 0) (= (ite .cse4 0 v_~z$r_buff0_thd1~0_219) v_~z$r_buff0_thd1~0_218) (= |v_P0Thread1of1ForFork2_#res#1.offset_29| 0) (= v_~z$w_buff0_used~0_593 (ite .cse0 0 v_~z$w_buff0_used~0_594))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_594, ~z$w_buff0~0=v_~z$w_buff0~0_355, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_148, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_521, ~z$w_buff1~0=v_~z$w_buff1~0_295, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_228, ~z~0=v_~z~0_448, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_219} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_593, ~z$w_buff0~0=v_~z$w_buff0~0_355, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_147, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_520, ~z$w_buff1~0=v_~z$w_buff1~0_295, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~z~0=v_~z~0_447, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_218} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [454] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_193 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_549 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_190 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~z$w_buff0_used~0_550 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_483 256) 0))))) (and (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_69| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= v_~z$r_buff1_thd0~0_192 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_482 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_189 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_193)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_109 0) (= 2 v_~__unbuffered_p2_EAX~0_69) (= v_~x~0_74 2) (= v_~y~0_87 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= v_~z$r_buff0_thd0~0_189 (ite .cse2 0 v_~z$r_buff0_thd0~0_190)) (= v_~z$w_buff0_used~0_549 (ite .cse3 0 v_~z$w_buff0_used~0_550)) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= v_~z$w_buff1_used~0_482 (ite (or .cse4 .cse2) 0 v_~z$w_buff1_used~0_483)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)) (= v_~z~0_411 (ite .cse3 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_273 v_~z~0_412)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_109, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_550, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_193, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_483, ~z$w_buff1~0=v_~z$w_buff1~0_273, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~z~0=v_~z~0_412, ~y~0=v_~y~0_87, ~x~0=v_~x~0_74} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_85|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_549, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_73|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_482, ~z$w_buff1~0=v_~z$w_buff1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_189, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_69|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_192, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~z~0=v_~z~0_411, ~y~0=v_~y~0_87, ~x~0=v_~x~0_74, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:22:03,938 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:22:03,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 765 [2022-12-06 06:22:03,938 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 257 flow [2022-12-06 06:22:03,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 06:22:03,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:03,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:03,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:22:03,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1951899494, now seen corresponding path program 1 times [2022-12-06 06:22:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501672450] [2022-12-06 06:22:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:22:03,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:22:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:22:04,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:22:04,024 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:22:04,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:22:04,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:22:04,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:22:04,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:22:04,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:22:04,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:22:04,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:22:04,027 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:04,031 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:22:04,031 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:22:04,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:22:04 BasicIcfg [2022-12-06 06:22:04,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:22:04,069 INFO L158 Benchmark]: Toolchain (without parser) took 11739.85ms. Allocated memory was 188.7MB in the beginning and 455.1MB in the end (delta: 266.3MB). Free memory was 163.1MB in the beginning and 228.9MB in the end (delta: -65.7MB). Peak memory consumption was 201.7MB. Max. memory is 8.0GB. [2022-12-06 06:22:04,069 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 110.8MB in the beginning and 110.8MB in the end (delta: 49.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:22:04,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.00ms. Allocated memory is still 188.7MB. Free memory was 163.1MB in the beginning and 136.6MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:22:04,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.55ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 166.1MB in the end (delta: -29.5MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2022-12-06 06:22:04,069 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 188.7MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:22:04,069 INFO L158 Benchmark]: RCFGBuilder took 609.11ms. Allocated memory is still 188.7MB. Free memory was 164.0MB in the beginning and 129.4MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:22:04,070 INFO L158 Benchmark]: TraceAbstraction took 10453.50ms. Allocated memory was 188.7MB in the beginning and 455.1MB in the end (delta: 266.3MB). Free memory was 128.3MB in the beginning and 228.9MB in the end (delta: -100.5MB). Peak memory consumption was 165.8MB. Max. memory is 8.0GB. [2022-12-06 06:22:04,070 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 110.8MB in the beginning and 110.8MB in the end (delta: 49.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.00ms. Allocated memory is still 188.7MB. Free memory was 163.1MB in the beginning and 136.6MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 90.55ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 166.1MB in the end (delta: -29.5MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 188.7MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.11ms. Allocated memory is still 188.7MB. Free memory was 164.0MB in the beginning and 129.4MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10453.50ms. Allocated memory was 188.7MB in the beginning and 455.1MB in the end (delta: 266.3MB). Free memory was 128.3MB in the beginning and 228.9MB in the end (delta: -100.5MB). Peak memory consumption was 165.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 114 PlacesBefore, 39 PlacesAfterwards, 106 TransitionsBefore, 30 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1579, independent: 1522, independent conditional: 1522, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1579, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1579, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1579, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1281, independent: 1239, independent conditional: 0, independent unconditional: 1239, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1281, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 195, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1579, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1281, unknown conditional: 0, unknown unconditional: 1281] , Statistics on independence cache: Total cache size (in pairs): 1940, Positive cache size: 1898, Positive conditional cache size: 0, Positive unconditional cache size: 1898, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 32 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 165, independent conditional: 165, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 165, independent conditional: 34, independent unconditional: 131, dependent: 49, dependent conditional: 16, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 165, independent conditional: 34, independent unconditional: 131, dependent: 49, dependent conditional: 16, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 165, independent conditional: 34, independent unconditional: 131, dependent: 49, dependent conditional: 16, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 86, independent conditional: 17, independent unconditional: 69, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 98, dependent conditional: 37, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 214, independent: 79, independent conditional: 17, independent unconditional: 62, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 110, unknown conditional: 25, unknown unconditional: 85] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 87, Positive conditional cache size: 18, Positive unconditional cache size: 69, Negative cache size: 24, Negative conditional cache size: 8, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 10, independent unconditional: 65, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 96, Positive conditional cache size: 18, Positive unconditional cache size: 78, Negative cache size: 30, Negative conditional cache size: 8, Negative unconditional cache size: 22, 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, 37 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 77, independent conditional: 77, 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: 93, independent: 77, independent conditional: 19, independent unconditional: 58, 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: 93, independent: 77, independent conditional: 0, independent unconditional: 77, 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: 93, independent: 77, independent conditional: 0, independent unconditional: 77, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 104, Positive conditional cache size: 18, Positive unconditional cache size: 86, Negative cache size: 30, Negative conditional cache size: 8, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 79, 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: 101, independent: 79, independent conditional: 29, independent unconditional: 50, 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: 101, independent: 79, independent conditional: 9, independent unconditional: 70, 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: 101, independent: 79, independent conditional: 9, independent unconditional: 70, 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: 12, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 69, independent conditional: 5, independent unconditional: 64, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 114, Positive conditional cache size: 22, Positive unconditional cache size: 92, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 73, 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: 95, independent: 73, independent conditional: 22, independent unconditional: 51, 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: 95, independent: 73, independent conditional: 0, independent unconditional: 73, 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: 95, independent: 73, independent conditional: 0, independent unconditional: 73, 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: 2, independent: 2, independent conditional: 0, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 95, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 116, Positive conditional cache size: 22, Positive unconditional cache size: 94, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 336, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 336, independent: 286, independent conditional: 140, independent unconditional: 146, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, independent: 286, independent conditional: 42, independent unconditional: 244, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, independent: 286, independent conditional: 42, independent unconditional: 244, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, independent: 277, independent conditional: 37, independent unconditional: 240, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 130, Positive conditional cache size: 27, Positive unconditional cache size: 103, Negative cache size: 34, Negative conditional cache size: 8, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 98, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 56 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 283, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 283, independent: 225, independent conditional: 105, independent unconditional: 120, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 283, independent: 225, independent conditional: 35, independent unconditional: 190, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 283, independent: 225, independent conditional: 35, independent unconditional: 190, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 283, independent: 220, independent conditional: 30, independent unconditional: 190, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 135, Positive conditional cache size: 32, Positive unconditional cache size: 103, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 74, independent conditional: 41, independent unconditional: 33, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 74, independent conditional: 29, independent unconditional: 45, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 74, independent conditional: 29, independent unconditional: 45, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 70, independent conditional: 25, independent unconditional: 45, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 139, Positive conditional cache size: 36, Positive unconditional cache size: 103, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 57 PlacesBefore, 54 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 121, independent conditional: 59, independent unconditional: 62, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 121, independent conditional: 35, independent unconditional: 86, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 121, independent conditional: 35, independent unconditional: 86, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 112, independent conditional: 29, independent unconditional: 83, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 149, Positive conditional cache size: 42, Positive unconditional cache size: 107, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 50 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 175, independent: 150, independent conditional: 116, independent unconditional: 34, dependent: 25, dependent conditional: 15, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 150, independent conditional: 101, independent unconditional: 49, dependent: 30, dependent conditional: 20, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 101, independent unconditional: 49, dependent: 30, dependent conditional: 20, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 23, independent conditional: 17, independent unconditional: 6, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 127, independent conditional: 84, independent unconditional: 43, dependent: 25, dependent conditional: 15, dependent unconditional: 10, unknown: 28, unknown conditional: 22, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 205, Positive conditional cache size: 59, Positive unconditional cache size: 146, Negative cache size: 41, Negative conditional cache size: 13, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t745, ((void *)0), P0, ((void *)0))=-2, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t746, ((void *)0), P1, ((void *)0))=-1, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t747, ((void *)0), P2, ((void *)0))=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: 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, 137 locations, 6 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: 10.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 736 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 17 mSDtfsCounter, 736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=7, InterpolantAutomatonStates: 45, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 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 06:22:04,106 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...