/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.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:21:53,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:21:53,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:21:53,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:21:53,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:21:53,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:21:53,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:21:53,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:21:53,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:21:53,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:21:53,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:21:53,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:21:53,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:21:53,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:21:53,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:21:53,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:21:53,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:21:53,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:21:53,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:21:53,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:21:53,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:21:53,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:21:53,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:21:53,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:21:53,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:21:53,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:21:53,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:21:53,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:21:53,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:21:53,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:21:53,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:21:53,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:21:53,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:21:53,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:21:53,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:21:53,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:21:53,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:21:53,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:21:53,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:21:53,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:21:53,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:21:53,643 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:53,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:21:53,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:21:53,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:21:53,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:21:53,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:21:53,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:21:53,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:21:53,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:53,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:21:53,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:21:53,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:21:53,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:21:53,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:21:53,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:21:53,675 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:54,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:21:54,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:21:54,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:21:54,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:21:54,053 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:21:54,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:21:55,350 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:21:55,680 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:21:55,680 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:21:55,701 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481839930/55d71a53584a4527989b066612db8de1/FLAGfc2d1002a [2022-12-06 06:21:55,719 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481839930/55d71a53584a4527989b066612db8de1 [2022-12-06 06:21:55,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:21:55,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:21:55,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:55,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:21:55,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:21:55,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:55" (1/1) ... [2022-12-06 06:21:55,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28763c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:55, skipping insertion in model container [2022-12-06 06:21:55,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:55" (1/1) ... [2022-12-06 06:21:55,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:21:55,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:21:55,910 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.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 06:21:56,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:56,127 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:21:56,137 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.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 06:21:56,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:56,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:56,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:56,228 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:21:56,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:56 WrapperNode [2022-12-06 06:21:56,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:56,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:56,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:21:56,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:21:56,235 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:56" (1/1) ... [2022-12-06 06:21:56,258 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:56" (1/1) ... [2022-12-06 06:21:56,287 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 06:21:56,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:56,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:21:56,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:21:56,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:21:56,295 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:56" (1/1) ... [2022-12-06 06:21:56,295 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:56" (1/1) ... [2022-12-06 06:21:56,316 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:56" (1/1) ... [2022-12-06 06:21:56,316 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:56" (1/1) ... [2022-12-06 06:21:56,336 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:56" (1/1) ... [2022-12-06 06:21:56,338 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:56" (1/1) ... [2022-12-06 06:21:56,339 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:56" (1/1) ... [2022-12-06 06:21:56,340 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:56" (1/1) ... [2022-12-06 06:21:56,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:21:56,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:21:56,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:21:56,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:21:56,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:56" (1/1) ... [2022-12-06 06:21:56,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:56,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:56,393 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:56,415 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:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:21:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:21:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:21:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:21:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:21:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:21:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:21:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:21:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:21:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:21:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:21:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:21:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:21:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:21:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:21:56,446 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:56,662 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:21:56,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:21:56,964 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:21:57,083 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:21:57,083 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:21:57,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:57 BoogieIcfgContainer [2022-12-06 06:21:57,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:21:57,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:21:57,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:21:57,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:21:57,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:21:55" (1/3) ... [2022-12-06 06:21:57,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46414f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:57, skipping insertion in model container [2022-12-06 06:21:57,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:56" (2/3) ... [2022-12-06 06:21:57,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46414f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:57, skipping insertion in model container [2022-12-06 06:21:57,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:57" (3/3) ... [2022-12-06 06:21:57,091 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:21:57,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:21:57,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:21:57,134 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:21:57,166 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:21:57,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:21:57,222 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:21:57,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:57,227 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 58 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:57,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:21:57,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:57,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:57,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:57,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:57,272 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:21:57,272 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:57,273 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 58 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:57,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:57,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-06 06:22:00,943 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:22:00,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:22:00,963 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;@45f9526f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:22:00,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:22:00,966 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 06:22:00,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:22:00,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:00,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:22:00,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 448585874, now seen corresponding path program 1 times [2022-12-06 06:22:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:00,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090431510] [2022-12-06 06:22:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:01,269 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,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090431510] [2022-12-06 06:22:01,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090431510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:01,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:01,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:22:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991167020] [2022-12-06 06:22:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:01,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:01,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:22:01,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 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:01,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:01,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:22:01,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:01,574 INFO L130 PetriNetUnfolder]: 1023/1606 cut-off events. [2022-12-06 06:22:01,574 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:22:01,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1606 events. 1023/1606 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8001 event pairs, 280 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 3170. Up to 1228 conditions per place. [2022-12-06 06:22:01,589 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 29 selfloop transitions, 2 changer transitions 6/41 dead transitions. [2022-12-06 06:22:01,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 168 flow [2022-12-06 06:22:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:22:01,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 06:22:01,600 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:22:01,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 168 flow [2022-12-06 06:22:01,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:01,604 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2022-12-06 06:22:01,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-06 06:22:01,608 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:22:01,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:01,609 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 56 flow [2022-12-06 06:22:01,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:01,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:01,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 56 flow [2022-12-06 06:22:01,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2022-12-06 06:22:01,623 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:22:01,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:22:01,624 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:22:01,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2022-12-06 06:22:01,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 06:22:01,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:01,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 344 [2022-12-06 06:22:01,952 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 06:22:01,952 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:01,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:01,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:01,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:22:01,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1106249742, now seen corresponding path program 1 times [2022-12-06 06:22:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:01,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17120556] [2022-12-06 06:22:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:02,235 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,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:02,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17120556] [2022-12-06 06:22:02,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17120556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:02,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:02,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288536809] [2022-12-06 06:22:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:02,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:02,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:02,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:22:02,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:22:02,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:02,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:22:02,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:02,492 INFO L130 PetriNetUnfolder]: 1433/2124 cut-off events. [2022-12-06 06:22:02,492 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-06 06:22:02,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 2124 events. 1433/2124 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8791 event pairs, 429 based on Foata normal form. 70/2194 useless extension candidates. Maximal degree in co-relation 4424. Up to 1392 conditions per place. [2022-12-06 06:22:02,501 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 34 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2022-12-06 06:22:02,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 180 flow [2022-12-06 06:22:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:22:02,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:22:02,503 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:22:02,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 180 flow [2022-12-06 06:22:02,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:02,506 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 110 flow [2022-12-06 06:22:02,506 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 06:22:02,506 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:22:02,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:02,507 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 110 flow [2022-12-06 06:22:02,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:02,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:02,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 110 flow [2022-12-06 06:22:02,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 110 flow [2022-12-06 06:22:02,533 INFO L130 PetriNetUnfolder]: 122/232 cut-off events. [2022-12-06 06:22:02,534 INFO L131 PetriNetUnfolder]: For 35/40 co-relation queries the response was YES. [2022-12-06 06:22:02,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 232 events. 122/232 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1036 event pairs, 60 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 520. Up to 179 conditions per place. [2022-12-06 06:22:02,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 110 flow [2022-12-06 06:22:02,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 06:22:02,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [435] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_134 256) 0))) (.cse2 (not (= 0 (mod v_~x$w_buff0_used~0_278 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_135 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_279 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_245 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_245) v_~x$w_buff1_used~0_244) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| 0)) (= v_~x$r_buff0_thd0~0_134 (ite .cse1 0 v_~x$r_buff0_thd0~0_135)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_134 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_244 256) 0)))) 0 v_~x$r_buff1_thd0~0_134) v_~x$r_buff1_thd0~0_133) (= v_~x$w_buff0_used~0_278 (ite .cse4 0 v_~x$w_buff0_used~0_279)) (= (ite .cse4 v_~x$w_buff0~0_155 (ite .cse0 v_~x$w_buff1~0_127 v_~x~0_205)) v_~x~0_204)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_134, ~x~0=v_~x~0_205, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_279, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_133, ~x~0=v_~x~0_204, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_278, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:02,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [343] L796-->L799: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-06 06:22:02,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [328] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd1~0_19 (ite .cse1 0 v_~x$r_buff0_thd1~0_20)) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_77 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse2 v_~x$w_buff1~0_42 v_~x~0_78))) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_100 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0)))) 0 v_~x$r_buff1_thd1~0_18) v_~x$r_buff1_thd1~0_17)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:02,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [344] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_79 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_78 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= v_~x$w_buff1_used~0_78 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_79)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse4 v_~x$w_buff1~0_34 v_~x~0_60)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_34, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_34, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:02,836 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:02,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-06 06:22:02,838 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 112 flow [2022-12-06 06:22:02,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:22:02,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:02,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:02,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:22:02,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2036321072, now seen corresponding path program 1 times [2022-12-06 06:22:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:02,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927638830] [2022-12-06 06:22:02,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:03,106 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:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:03,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927638830] [2022-12-06 06:22:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927638830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:03,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:03,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699651509] [2022-12-06 06:22:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:03,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:03,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:03,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:22:03,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:03,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:03,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:22:03,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:03,307 INFO L130 PetriNetUnfolder]: 1121/1684 cut-off events. [2022-12-06 06:22:03,308 INFO L131 PetriNetUnfolder]: For 945/1143 co-relation queries the response was YES. [2022-12-06 06:22:03,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 1684 events. 1121/1684 cut-off events. For 945/1143 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7611 event pairs, 363 based on Foata normal form. 32/1660 useless extension candidates. Maximal degree in co-relation 4531. Up to 1502 conditions per place. [2022-12-06 06:22:03,316 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-06 06:22:03,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 216 flow [2022-12-06 06:22:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:22:03,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2022-12-06 06:22:03,318 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 112 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:22:03,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 216 flow [2022-12-06 06:22:03,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:03,320 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 129 flow [2022-12-06 06:22:03,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 06:22:03,320 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-06 06:22:03,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:03,320 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 129 flow [2022-12-06 06:22:03,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:03,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:03,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 129 flow [2022-12-06 06:22:03,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 129 flow [2022-12-06 06:22:03,350 INFO L130 PetriNetUnfolder]: 178/322 cut-off events. [2022-12-06 06:22:03,351 INFO L131 PetriNetUnfolder]: For 218/234 co-relation queries the response was YES. [2022-12-06 06:22:03,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 322 events. 178/322 cut-off events. For 218/234 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1500 event pairs, 85 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 776. Up to 247 conditions per place. [2022-12-06 06:22:03,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 129 flow [2022-12-06 06:22:03,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 06:22:03,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:03,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:22:03,359 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 129 flow [2022-12-06 06:22:03,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:03,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:03,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:03,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:22:03,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1298527393, now seen corresponding path program 1 times [2022-12-06 06:22:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:03,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137559711] [2022-12-06 06:22:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:03,757 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:03,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:03,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137559711] [2022-12-06 06:22:03,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137559711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:03,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:03,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764774288] [2022-12-06 06:22:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:03,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:03,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:22:03,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:03,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:03,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:22:03,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:04,009 INFO L130 PetriNetUnfolder]: 1129/1700 cut-off events. [2022-12-06 06:22:04,009 INFO L131 PetriNetUnfolder]: For 1314/1530 co-relation queries the response was YES. [2022-12-06 06:22:04,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1700 events. 1129/1700 cut-off events. For 1314/1530 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7636 event pairs, 327 based on Foata normal form. 53/1707 useless extension candidates. Maximal degree in co-relation 4875. Up to 1419 conditions per place. [2022-12-06 06:22:04,019 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 42 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 06:22:04,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 317 flow [2022-12-06 06:22:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 06:22:04,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:22:04,022 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 129 flow. Second operand 4 states and 63 transitions. [2022-12-06 06:22:04,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 317 flow [2022-12-06 06:22:04,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:04,026 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 186 flow [2022-12-06 06:22:04,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-06 06:22:04,027 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-06 06:22:04,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:04,027 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 186 flow [2022-12-06 06:22:04,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:04,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:04,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 186 flow [2022-12-06 06:22:04,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 186 flow [2022-12-06 06:22:04,059 INFO L130 PetriNetUnfolder]: 191/344 cut-off events. [2022-12-06 06:22:04,060 INFO L131 PetriNetUnfolder]: For 403/442 co-relation queries the response was YES. [2022-12-06 06:22:04,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 344 events. 191/344 cut-off events. For 403/442 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1612 event pairs, 78 based on Foata normal form. 3/322 useless extension candidates. Maximal degree in co-relation 994. Up to 254 conditions per place. [2022-12-06 06:22:04,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 186 flow [2022-12-06 06:22:04,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:22:04,429 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:04,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-06 06:22:04,434 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 192 flow [2022-12-06 06:22:04,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:04,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:04,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:04,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:22:04,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 687315275, now seen corresponding path program 1 times [2022-12-06 06:22:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:04,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308866454] [2022-12-06 06:22:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:04,719 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:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308866454] [2022-12-06 06:22:04,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308866454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:04,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:04,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710205801] [2022-12-06 06:22:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:04,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:04,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:22:04,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 192 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:04,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:04,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:22:04,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:05,052 INFO L130 PetriNetUnfolder]: 1748/2593 cut-off events. [2022-12-06 06:22:05,053 INFO L131 PetriNetUnfolder]: For 2785/2785 co-relation queries the response was YES. [2022-12-06 06:22:05,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8192 conditions, 2593 events. 1748/2593 cut-off events. For 2785/2785 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11764 event pairs, 497 based on Foata normal form. 28/2621 useless extension candidates. Maximal degree in co-relation 8175. Up to 1655 conditions per place. [2022-12-06 06:22:05,071 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 60 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2022-12-06 06:22:05,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 78 transitions, 507 flow [2022-12-06 06:22:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 06:22:05,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2022-12-06 06:22:05,076 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 192 flow. Second operand 5 states and 74 transitions. [2022-12-06 06:22:05,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 78 transitions, 507 flow [2022-12-06 06:22:05,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 490 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:05,080 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 307 flow [2022-12-06 06:22:05,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2022-12-06 06:22:05,082 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 06:22:05,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:05,082 INFO L89 Accepts]: Start accepts. Operand has 43 places, 46 transitions, 307 flow [2022-12-06 06:22:05,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:05,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:05,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 46 transitions, 307 flow [2022-12-06 06:22:05,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 46 transitions, 307 flow [2022-12-06 06:22:05,124 INFO L130 PetriNetUnfolder]: 253/492 cut-off events. [2022-12-06 06:22:05,125 INFO L131 PetriNetUnfolder]: For 947/986 co-relation queries the response was YES. [2022-12-06 06:22:05,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 492 events. 253/492 cut-off events. For 947/986 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2588 event pairs, 67 based on Foata normal form. 14/492 useless extension candidates. Maximal degree in co-relation 1787. Up to 340 conditions per place. [2022-12-06 06:22:05,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 46 transitions, 307 flow [2022-12-06 06:22:05,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 06:22:05,134 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:05,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 06:22:05,136 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 307 flow [2022-12-06 06:22:05,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:05,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:05,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:05,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:22:05,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1373580532, now seen corresponding path program 1 times [2022-12-06 06:22:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:05,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245863360] [2022-12-06 06:22:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:05,270 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:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:05,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245863360] [2022-12-06 06:22:05,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245863360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:05,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:05,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095286425] [2022-12-06 06:22:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:05,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:22:05,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:05,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:05,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:22:05,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:05,582 INFO L130 PetriNetUnfolder]: 1857/2901 cut-off events. [2022-12-06 06:22:05,582 INFO L131 PetriNetUnfolder]: For 6710/6730 co-relation queries the response was YES. [2022-12-06 06:22:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10456 conditions, 2901 events. 1857/2901 cut-off events. For 6710/6730 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14939 event pairs, 685 based on Foata normal form. 109/2972 useless extension candidates. Maximal degree in co-relation 10437. Up to 1381 conditions per place. [2022-12-06 06:22:05,595 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 42 selfloop transitions, 7 changer transitions 11/65 dead transitions. [2022-12-06 06:22:05,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 518 flow [2022-12-06 06:22:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:22:05,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-12-06 06:22:05,596 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 307 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:22:05,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 518 flow [2022-12-06 06:22:05,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 500 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-06 06:22:05,602 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 268 flow [2022-12-06 06:22:05,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-06 06:22:05,604 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-06 06:22:05,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:05,604 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 268 flow [2022-12-06 06:22:05,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:05,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:05,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 268 flow [2022-12-06 06:22:05,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 268 flow [2022-12-06 06:22:05,655 INFO L130 PetriNetUnfolder]: 274/550 cut-off events. [2022-12-06 06:22:05,656 INFO L131 PetriNetUnfolder]: For 1435/1485 co-relation queries the response was YES. [2022-12-06 06:22:05,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 550 events. 274/550 cut-off events. For 1435/1485 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3033 event pairs, 92 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1968. Up to 367 conditions per place. [2022-12-06 06:22:05,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 268 flow [2022-12-06 06:22:05,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 06:22:05,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L773-->L806: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_112 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_433 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_114 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_434 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_394 256) 0))))) (and (= v_~x$w_buff0_used~0_433 (ite .cse0 0 v_~x$w_buff0_used~0_434)) (= (ite .cse0 v_~x$w_buff0~0_256 (ite .cse1 v_~x$w_buff1~0_224 v_~x~0_358)) v_~x~0_357) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_114) v_~x$r_buff0_thd3~0_113) (= v_~y~0_93 1) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_113 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_393 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_112) v_~x$r_buff1_thd3~0_111) (= v_~x$w_buff1_used~0_393 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_394))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_394, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_114, ~x~0=v_~x~0_358, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_434} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_393, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~y~0=v_~y~0_93, ~x~0=v_~x~0_357, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_433} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] and [414] $Ultimate##0-->L793: Formula: (and (= v_~y~0_33 2) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] [2022-12-06 06:22:05,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L773-->L799: Formula: (and (= v_~y~0_89 1) (= v_~__unbuffered_p2_EBX~0_61 v_~z~0_31)) InVars {~z~0=v_~z~0_31} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ~z~0=v_~z~0_31, ~y~0=v_~y~0_89} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y~0] and [414] $Ultimate##0-->L793: Formula: (and (= v_~y~0_33 2) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] [2022-12-06 06:22:05,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:05,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 06:22:05,766 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 278 flow [2022-12-06 06:22:05,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:05,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:05,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:05,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:22:05,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1804029175, now seen corresponding path program 2 times [2022-12-06 06:22:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:05,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484545860] [2022-12-06 06:22:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:06,097 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:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:06,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484545860] [2022-12-06 06:22:06,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484545860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:06,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:06,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301891357] [2022-12-06 06:22:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:06,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:06,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:06,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:06,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:22:06,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:06,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:06,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:22:06,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:06,431 INFO L130 PetriNetUnfolder]: 1389/2222 cut-off events. [2022-12-06 06:22:06,431 INFO L131 PetriNetUnfolder]: For 5003/5020 co-relation queries the response was YES. [2022-12-06 06:22:06,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8290 conditions, 2222 events. 1389/2222 cut-off events. For 5003/5020 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11089 event pairs, 436 based on Foata normal form. 11/2222 useless extension candidates. Maximal degree in co-relation 8269. Up to 1781 conditions per place. [2022-12-06 06:22:06,451 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 52 selfloop transitions, 15 changer transitions 1/71 dead transitions. [2022-12-06 06:22:06,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 531 flow [2022-12-06 06:22:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 06:22:06,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2022-12-06 06:22:06,453 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 278 flow. Second operand 5 states and 74 transitions. [2022-12-06 06:22:06,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 531 flow [2022-12-06 06:22:06,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:06,461 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 311 flow [2022-12-06 06:22:06,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-12-06 06:22:06,461 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-06 06:22:06,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:06,461 INFO L89 Accepts]: Start accepts. Operand has 50 places, 43 transitions, 311 flow [2022-12-06 06:22:06,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:06,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:06,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 43 transitions, 311 flow [2022-12-06 06:22:06,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 311 flow [2022-12-06 06:22:06,503 INFO L130 PetriNetUnfolder]: 238/511 cut-off events. [2022-12-06 06:22:06,504 INFO L131 PetriNetUnfolder]: For 1312/1357 co-relation queries the response was YES. [2022-12-06 06:22:06,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 511 events. 238/511 cut-off events. For 1312/1357 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2923 event pairs, 111 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 1941. Up to 328 conditions per place. [2022-12-06 06:22:06,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 311 flow [2022-12-06 06:22:06,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 06:22:06,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:06,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 06:22:06,511 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 311 flow [2022-12-06 06:22:06,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:06,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:06,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:06,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:22:06,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1615701237, now seen corresponding path program 1 times [2022-12-06 06:22:06,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:06,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614332213] [2022-12-06 06:22:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:06,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:06,914 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:06,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:06,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614332213] [2022-12-06 06:22:06,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614332213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:06,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:06,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:22:06,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617404987] [2022-12-06 06:22:06,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:06,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:22:06,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:06,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:22:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:22:06,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:22:06,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 311 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:06,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:06,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:22:06,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:07,321 INFO L130 PetriNetUnfolder]: 2152/3274 cut-off events. [2022-12-06 06:22:07,321 INFO L131 PetriNetUnfolder]: For 8016/8016 co-relation queries the response was YES. [2022-12-06 06:22:07,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12637 conditions, 3274 events. 2152/3274 cut-off events. For 8016/8016 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15998 event pairs, 363 based on Foata normal form. 22/3296 useless extension candidates. Maximal degree in co-relation 12614. Up to 2307 conditions per place. [2022-12-06 06:22:07,337 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 58 selfloop transitions, 26 changer transitions 2/86 dead transitions. [2022-12-06 06:22:07,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 698 flow [2022-12-06 06:22:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 06:22:07,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:22:07,339 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 311 flow. Second operand 5 states and 70 transitions. [2022-12-06 06:22:07,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 698 flow [2022-12-06 06:22:07,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 682 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:07,345 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 493 flow [2022-12-06 06:22:07,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=493, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2022-12-06 06:22:07,346 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-06 06:22:07,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:07,347 INFO L89 Accepts]: Start accepts. Operand has 55 places, 54 transitions, 493 flow [2022-12-06 06:22:07,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:07,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:07,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 493 flow [2022-12-06 06:22:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 493 flow [2022-12-06 06:22:07,404 INFO L130 PetriNetUnfolder]: 356/715 cut-off events. [2022-12-06 06:22:07,404 INFO L131 PetriNetUnfolder]: For 2463/2524 co-relation queries the response was YES. [2022-12-06 06:22:07,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 715 events. 356/715 cut-off events. For 2463/2524 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4098 event pairs, 50 based on Foata normal form. 4/710 useless extension candidates. Maximal degree in co-relation 3380. Up to 476 conditions per place. [2022-12-06 06:22:07,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 493 flow [2022-12-06 06:22:07,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 06:22:07,415 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:07,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 06:22:07,417 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 493 flow [2022-12-06 06:22:07,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:07,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:07,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:07,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:22:07,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1582159454, now seen corresponding path program 1 times [2022-12-06 06:22:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:07,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020445525] [2022-12-06 06:22:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:22:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:07,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020445525] [2022-12-06 06:22:07,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020445525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:07,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:07,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645658636] [2022-12-06 06:22:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:07,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:07,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 06:22:07,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:07,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:07,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 06:22:07,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:08,190 INFO L130 PetriNetUnfolder]: 1870/3001 cut-off events. [2022-12-06 06:22:08,190 INFO L131 PetriNetUnfolder]: For 12735/12773 co-relation queries the response was YES. [2022-12-06 06:22:08,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13887 conditions, 3001 events. 1870/3001 cut-off events. For 12735/12773 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16151 event pairs, 376 based on Foata normal form. 47/2992 useless extension candidates. Maximal degree in co-relation 13860. Up to 2023 conditions per place. [2022-12-06 06:22:08,207 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 57 selfloop transitions, 23 changer transitions 4/90 dead transitions. [2022-12-06 06:22:08,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 901 flow [2022-12-06 06:22:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 06:22:08,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 06:22:08,208 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 493 flow. Second operand 5 states and 73 transitions. [2022-12-06 06:22:08,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 901 flow [2022-12-06 06:22:08,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 824 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:08,222 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 574 flow [2022-12-06 06:22:08,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-06 06:22:08,222 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-06 06:22:08,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:08,223 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 574 flow [2022-12-06 06:22:08,223 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:08,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:08,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 574 flow [2022-12-06 06:22:08,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 574 flow [2022-12-06 06:22:08,297 INFO L130 PetriNetUnfolder]: 343/685 cut-off events. [2022-12-06 06:22:08,297 INFO L131 PetriNetUnfolder]: For 2589/2627 co-relation queries the response was YES. [2022-12-06 06:22:08,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 685 events. 343/685 cut-off events. For 2589/2627 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3925 event pairs, 68 based on Foata normal form. 4/680 useless extension candidates. Maximal degree in co-relation 3395. Up to 477 conditions per place. [2022-12-06 06:22:08,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 574 flow [2022-12-06 06:22:08,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 06:22:08,310 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:08,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 06:22:08,311 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 574 flow [2022-12-06 06:22:08,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:08,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:08,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:22:08,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1235992100, now seen corresponding path program 1 times [2022-12-06 06:22:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69992901] [2022-12-06 06:22:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:08,499 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:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:08,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69992901] [2022-12-06 06:22:08,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69992901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:08,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:08,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920110435] [2022-12-06 06:22:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:08,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 06:22:08,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 574 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:08,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:08,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 06:22:08,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:08,814 INFO L130 PetriNetUnfolder]: 1295/2259 cut-off events. [2022-12-06 06:22:08,814 INFO L131 PetriNetUnfolder]: For 14906/15142 co-relation queries the response was YES. [2022-12-06 06:22:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 2259 events. 1295/2259 cut-off events. For 14906/15142 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13643 event pairs, 217 based on Foata normal form. 427/2632 useless extension candidates. Maximal degree in co-relation 10545. Up to 1190 conditions per place. [2022-12-06 06:22:08,824 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 101 selfloop transitions, 7 changer transitions 31/150 dead transitions. [2022-12-06 06:22:08,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 150 transitions, 1729 flow [2022-12-06 06:22:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 06:22:08,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:22:08,825 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 574 flow. Second operand 5 states and 80 transitions. [2022-12-06 06:22:08,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 150 transitions, 1729 flow [2022-12-06 06:22:08,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 150 transitions, 1639 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:08,835 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 586 flow [2022-12-06 06:22:08,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2022-12-06 06:22:08,835 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-06 06:22:08,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:08,835 INFO L89 Accepts]: Start accepts. Operand has 62 places, 64 transitions, 586 flow [2022-12-06 06:22:08,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:08,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:08,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 64 transitions, 586 flow [2022-12-06 06:22:08,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 586 flow [2022-12-06 06:22:08,910 INFO L130 PetriNetUnfolder]: 434/938 cut-off events. [2022-12-06 06:22:08,911 INFO L131 PetriNetUnfolder]: For 4676/4934 co-relation queries the response was YES. [2022-12-06 06:22:08,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 938 events. 434/938 cut-off events. For 4676/4934 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6307 event pairs, 129 based on Foata normal form. 93/977 useless extension candidates. Maximal degree in co-relation 4343. Up to 465 conditions per place. [2022-12-06 06:22:08,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 64 transitions, 586 flow [2022-12-06 06:22:08,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 06:22:09,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L828-3-->L832: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [427] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_13| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-06 06:22:09,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L828-3-->L832: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [447] L754-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_97 (+ v_~__unbuffered_cnt~0_98 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:22:09,498 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:22:09,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 664 [2022-12-06 06:22:09,499 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 588 flow [2022-12-06 06:22:09,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:09,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:09,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:09,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:22:09,500 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -242099031, now seen corresponding path program 1 times [2022-12-06 06:22:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:09,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492473021] [2022-12-06 06:22:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:09,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:09,613 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:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:09,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492473021] [2022-12-06 06:22:09,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492473021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:09,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:09,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074548882] [2022-12-06 06:22:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:09,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:09,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 06:22:09,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:09,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:09,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 06:22:09,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:09,833 INFO L130 PetriNetUnfolder]: 708/1359 cut-off events. [2022-12-06 06:22:09,833 INFO L131 PetriNetUnfolder]: For 9372/9544 co-relation queries the response was YES. [2022-12-06 06:22:09,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 1359 events. 708/1359 cut-off events. For 9372/9544 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7971 event pairs, 73 based on Foata normal form. 202/1526 useless extension candidates. Maximal degree in co-relation 6922. Up to 544 conditions per place. [2022-12-06 06:22:09,840 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 81 selfloop transitions, 12 changer transitions 37/141 dead transitions. [2022-12-06 06:22:09,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 1561 flow [2022-12-06 06:22:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:22:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:22:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-06 06:22:09,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2022-12-06 06:22:09,842 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 588 flow. Second operand 6 states and 97 transitions. [2022-12-06 06:22:09,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 1561 flow [2022-12-06 06:22:09,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 141 transitions, 1545 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:09,852 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 591 flow [2022-12-06 06:22:09,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=591, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2022-12-06 06:22:09,853 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-06 06:22:09,854 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:09,854 INFO L89 Accepts]: Start accepts. Operand has 68 places, 63 transitions, 591 flow [2022-12-06 06:22:09,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:09,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:09,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 63 transitions, 591 flow [2022-12-06 06:22:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 63 transitions, 591 flow [2022-12-06 06:22:09,896 INFO L130 PetriNetUnfolder]: 168/522 cut-off events. [2022-12-06 06:22:09,896 INFO L131 PetriNetUnfolder]: For 3139/3436 co-relation queries the response was YES. [2022-12-06 06:22:09,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 522 events. 168/522 cut-off events. For 3139/3436 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3561 event pairs, 20 based on Foata normal form. 44/551 useless extension candidates. Maximal degree in co-relation 2545. Up to 262 conditions per place. [2022-12-06 06:22:09,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 63 transitions, 591 flow [2022-12-06 06:22:09,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 06:22:09,947 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:22:09,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 06:22:09,949 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 562 flow [2022-12-06 06:22:09,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:09,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:09,949 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:09,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:22:09,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:22:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash -202249994, now seen corresponding path program 1 times [2022-12-06 06:22:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:09,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359521853] [2022-12-06 06:22:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:10,097 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:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359521853] [2022-12-06 06:22:10,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359521853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:10,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:10,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:22:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952611243] [2022-12-06 06:22:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:10,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:10,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:10,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:10,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 06:22:10,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:10,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:10,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 06:22:10,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:10,261 INFO L130 PetriNetUnfolder]: 416/840 cut-off events. [2022-12-06 06:22:10,262 INFO L131 PetriNetUnfolder]: For 5775/5832 co-relation queries the response was YES. [2022-12-06 06:22:10,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4462 conditions, 840 events. 416/840 cut-off events. For 5775/5832 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4570 event pairs, 62 based on Foata normal form. 60/891 useless extension candidates. Maximal degree in co-relation 4426. Up to 344 conditions per place. [2022-12-06 06:22:10,266 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 61 selfloop transitions, 13 changer transitions 33/116 dead transitions. [2022-12-06 06:22:10,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 1304 flow [2022-12-06 06:22:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:22:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:22:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-06 06:22:10,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2022-12-06 06:22:10,268 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 562 flow. Second operand 8 states and 97 transitions. [2022-12-06 06:22:10,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 1304 flow [2022-12-06 06:22:10,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 1221 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-06 06:22:10,278 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 455 flow [2022-12-06 06:22:10,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2022-12-06 06:22:10,279 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-06 06:22:10,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:10,279 INFO L89 Accepts]: Start accepts. Operand has 74 places, 52 transitions, 455 flow [2022-12-06 06:22:10,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:10,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:10,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 52 transitions, 455 flow [2022-12-06 06:22:10,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 52 transitions, 455 flow [2022-12-06 06:22:10,304 INFO L130 PetriNetUnfolder]: 88/274 cut-off events. [2022-12-06 06:22:10,304 INFO L131 PetriNetUnfolder]: For 1426/1468 co-relation queries the response was YES. [2022-12-06 06:22:10,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 274 events. 88/274 cut-off events. For 1426/1468 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1484 event pairs, 6 based on Foata normal form. 25/298 useless extension candidates. Maximal degree in co-relation 1204. Up to 135 conditions per place. [2022-12-06 06:22:10,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 52 transitions, 455 flow [2022-12-06 06:22:10,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 06:22:10,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [375] $Ultimate##0-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_77 v_~x$r_buff0_thd0~0_81) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd1~0_41 v_~x$r_buff0_thd1~0_41) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff0_thd2~0_48 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_179 256) 0)) (not (= (mod v_~x$w_buff1_used~0_154 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_180 v_~x$w_buff1_used~0_154) (= v_~x$w_buff0_used~0_179 1) (= v_~x$r_buff1_thd2~0_35 v_~x$r_buff0_thd2~0_49) (= v_~x$w_buff0~0_96 v_~x$w_buff1~0_82) (= v_~x$r_buff1_thd3~0_39 v_~x$r_buff0_thd3~0_41) (= 2 v_~x$w_buff0~0_95)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_81, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_81, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_82, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_39, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_179, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 06:22:10,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [461] L828-3-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_19|) (= |v_P0Thread1of1ForFork0_#res.base_19| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_154 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_54) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1)) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_19|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_49|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_61|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ULTIMATE.start_main_#t~nondet8#1, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [427] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_13| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-06 06:28:34,011 WARN L233 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 1124 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 06:32:11,725 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:32:11,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 601447 [2022-12-06 06:32:11,726 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 425 flow [2022-12-06 06:32:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:32:11,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:11,726 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:32:11,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:32:11,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:32:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 870123860, now seen corresponding path program 1 times [2022-12-06 06:32:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:11,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257558567] [2022-12-06 06:32:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:11,879 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:32:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:11,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257558567] [2022-12-06 06:32:11,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257558567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:11,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:11,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:32:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600403251] [2022-12-06 06:32:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:11,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:32:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:11,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:32:11,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:32:11,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 06:32:11,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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:32:11,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:11,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 06:32:11,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:12,000 INFO L130 PetriNetUnfolder]: 392/771 cut-off events. [2022-12-06 06:32:12,000 INFO L131 PetriNetUnfolder]: For 3485/3496 co-relation queries the response was YES. [2022-12-06 06:32:12,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3953 conditions, 771 events. 392/771 cut-off events. For 3485/3496 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3998 event pairs, 48 based on Foata normal form. 1/762 useless extension candidates. Maximal degree in co-relation 3916. Up to 408 conditions per place. [2022-12-06 06:32:12,004 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 37 selfloop transitions, 1 changer transitions 44/86 dead transitions. [2022-12-06 06:32:12,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 942 flow [2022-12-06 06:32:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:32:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:32:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 06:32:12,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-06 06:32:12,005 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 425 flow. Second operand 4 states and 50 transitions. [2022-12-06 06:32:12,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 942 flow [2022-12-06 06:32:12,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 818 flow, removed 32 selfloop flow, removed 12 redundant places. [2022-12-06 06:32:12,012 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 253 flow [2022-12-06 06:32:12,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-06 06:32:12,012 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-06 06:32:12,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:12,012 INFO L89 Accepts]: Start accepts. Operand has 58 places, 34 transitions, 253 flow [2022-12-06 06:32:12,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:12,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:12,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 34 transitions, 253 flow [2022-12-06 06:32:12,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 34 transitions, 253 flow [2022-12-06 06:32:12,022 INFO L130 PetriNetUnfolder]: 31/96 cut-off events. [2022-12-06 06:32:12,022 INFO L131 PetriNetUnfolder]: For 314/325 co-relation queries the response was YES. [2022-12-06 06:32:12,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 96 events. 31/96 cut-off events. For 314/325 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 337 event pairs, 5 based on Foata normal form. 9/104 useless extension candidates. Maximal degree in co-relation 353. Up to 42 conditions per place. [2022-12-06 06:32:12,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 34 transitions, 253 flow [2022-12-06 06:32:12,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 06:32:12,401 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:32:12,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-06 06:32:12,402 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 263 flow [2022-12-06 06:32:12,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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:32:12,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:12,402 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:32:12,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:32:12,403 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:32:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash -756720371, now seen corresponding path program 1 times [2022-12-06 06:32:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:12,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242589946] [2022-12-06 06:32:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:32:12,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:32:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:32:12,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:32:12,474 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:32:12,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:32:12,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:32:12,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:32:12,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:32:12,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:32:12,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:32:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:32:12,477 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:12,481 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:32:12,481 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:32:12,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:32:12 BasicIcfg [2022-12-06 06:32:12,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:32:12,545 INFO L158 Benchmark]: Toolchain (without parser) took 616823.93ms. Allocated memory was 182.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 157.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 171.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:12,546 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:32:12,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.25ms. Allocated memory is still 182.5MB. Free memory was 157.1MB in the beginning and 130.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:32:12,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.86ms. Allocated memory is still 182.5MB. Free memory was 130.8MB in the beginning and 127.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:12,546 INFO L158 Benchmark]: Boogie Preprocessor took 54.34ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 126.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:12,546 INFO L158 Benchmark]: RCFGBuilder took 742.30ms. Allocated memory is still 182.5MB. Free memory was 126.1MB in the beginning and 91.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:32:12,546 INFO L158 Benchmark]: TraceAbstraction took 615458.39ms. Allocated memory was 182.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 91.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 105.0MB. Max. memory is 8.0GB. [2022-12-06 06:32:12,550 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.25ms. Allocated memory is still 182.5MB. Free memory was 157.1MB in the beginning and 130.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.86ms. Allocated memory is still 182.5MB. Free memory was 130.8MB in the beginning and 127.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.34ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 126.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 742.30ms. Allocated memory is still 182.5MB. Free memory was 126.1MB in the beginning and 91.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 615458.39ms. Allocated memory was 182.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 91.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 105.0MB. 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, 38 PlacesAfterwards, 106 TransitionsBefore, 29 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1490, independent: 1433, independent conditional: 1433, 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: 1490, independent: 1433, independent conditional: 0, independent unconditional: 1433, 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: 1490, independent: 1433, independent conditional: 0, independent unconditional: 1433, 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: 1490, independent: 1433, independent conditional: 0, independent unconditional: 1433, 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: 1182, independent: 1148, independent conditional: 0, independent unconditional: 1148, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1182, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1490, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1182, unknown conditional: 0, unknown unconditional: 1182] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1662, Positive conditional cache size: 0, Positive unconditional cache size: 1662, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 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: 238, independent: 189, independent conditional: 189, 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: 238, independent: 189, independent conditional: 22, independent unconditional: 167, dependent: 49, dependent conditional: 6, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 189, independent conditional: 22, independent unconditional: 167, dependent: 49, dependent conditional: 6, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 189, independent conditional: 22, independent unconditional: 167, dependent: 49, dependent conditional: 6, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, independent: 102, independent conditional: 12, independent unconditional: 90, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 123, dependent conditional: 9, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, independent: 87, independent conditional: 10, independent unconditional: 77, dependent: 25, dependent conditional: 4, dependent unconditional: 21, unknown: 126, unknown conditional: 14, unknown unconditional: 112] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 103, Positive conditional cache size: 12, Positive unconditional cache size: 91, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 181, 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: 206, independent: 181, independent conditional: 10, independent unconditional: 171, dependent: 25, dependent conditional: 4, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 181, independent conditional: 7, independent unconditional: 174, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 7, independent unconditional: 174, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 166, independent conditional: 7, independent unconditional: 159, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 18, unknown conditional: 2, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 133, Positive conditional cache size: 12, Positive unconditional cache size: 121, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 58, independent conditional: 10, independent unconditional: 48, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 58, independent conditional: 6, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 58, independent conditional: 6, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 65, independent: 58, independent conditional: 6, independent unconditional: 52, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 133, Positive conditional cache size: 12, Positive unconditional cache size: 121, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 170, independent conditional: 170, 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: 186, independent: 170, independent conditional: 58, independent unconditional: 112, 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: 188, independent: 170, independent conditional: 44, independent unconditional: 126, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 170, independent conditional: 44, independent unconditional: 126, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 164, independent conditional: 38, independent unconditional: 126, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 146, Positive conditional cache size: 18, Positive unconditional cache size: 128, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 184, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 68, independent unconditional: 116, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 184, independent conditional: 50, independent unconditional: 134, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 50, independent unconditional: 134, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 2, independent unconditional: 11, 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: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 171, independent conditional: 48, independent unconditional: 123, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 159, Positive conditional cache size: 20, Positive unconditional cache size: 139, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, 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.1s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 243, independent: 225, independent conditional: 98, independent unconditional: 127, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243, independent: 225, independent conditional: 56, independent unconditional: 169, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243, independent: 225, independent conditional: 56, independent unconditional: 169, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 243, independent: 219, independent conditional: 56, independent unconditional: 163, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 171, Positive conditional cache size: 20, Positive unconditional cache size: 151, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 116, independent conditional: 44, independent unconditional: 72, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, independent: 115, independent conditional: 31, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 172, Positive conditional cache size: 20, Positive unconditional cache size: 152, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, independent: 203, independent conditional: 203, 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: 219, independent: 203, independent conditional: 89, independent unconditional: 114, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, independent: 203, independent conditional: 59, independent unconditional: 144, 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: 219, independent: 203, independent conditional: 59, independent unconditional: 144, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 219, independent: 201, independent conditional: 58, independent unconditional: 143, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 21, Positive unconditional cache size: 153, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 200, independent conditional: 78, independent unconditional: 122, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 221, independent: 200, independent conditional: 48, independent unconditional: 152, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 221, independent: 200, independent conditional: 48, independent unconditional: 152, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 221, independent: 200, independent conditional: 48, independent unconditional: 152, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 21, Positive unconditional cache size: 153, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 62 PlacesBefore, 62 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 275, independent conditional: 275, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 275, independent conditional: 181, independent unconditional: 94, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 275, independent conditional: 135, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 275, independent conditional: 135, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 285, independent: 263, independent conditional: 127, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 12, unknown conditional: 8, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 193, Positive conditional cache size: 29, Positive unconditional cache size: 164, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 63 TransitionsBefore, 60 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 295, independent: 280, independent conditional: 280, 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: 295, independent: 280, independent conditional: 175, independent unconditional: 105, 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: 295, independent: 280, independent conditional: 127, independent unconditional: 153, 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: 295, independent: 280, independent conditional: 127, independent unconditional: 153, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 295, independent: 264, independent conditional: 111, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 209, Positive conditional cache size: 45, Positive unconditional cache size: 164, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 601.4s, 73 PlacesBefore, 65 PlacesAfterwards, 52 TransitionsBefore, 46 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 155, independent conditional: 155, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 155, independent conditional: 99, independent unconditional: 56, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 155, independent conditional: 62, independent unconditional: 93, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 155, independent conditional: 62, independent unconditional: 93, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 163, independent: 144, independent conditional: 51, independent unconditional: 93, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 246, Positive conditional cache size: 57, Positive unconditional cache size: 189, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 55 PlacesBefore, 53 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 26, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 45, independent conditional: 19, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 316, Positive conditional cache size: 69, Positive unconditional cache size: 247, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - 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; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((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(&t748, ((void *)0), P0, ((void *)0))=-3, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((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(&t749, ((void *)0), P1, ((void *)0))=-2, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((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(&t750, ((void *)0), P2, ((void *)0))=-1, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 [L746] 1 x = 1 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - 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: 826]: 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: 824]: 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: 828]: 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: 615.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1113 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 25 mSDtfsCounter, 1113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=11, InterpolantAutomatonStates: 60, 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, 2.9s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:32:12,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...