/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/mix025_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:21:08,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:21:08,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:21:08,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:21:08,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:21:08,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:21:08,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:21:08,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:21:08,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:21:08,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:21:08,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:21:08,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:21:08,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:21:08,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:21:08,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:21:08,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:21:08,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:21:08,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:21:08,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:21:08,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:21:08,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:21:08,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:21:08,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:21:08,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:21:08,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:21:08,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:21:08,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:21:08,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:21:08,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:21:08,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:21:08,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:21:08,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:21:08,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:21:08,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:21:08,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:21:08,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:21:08,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:21:08,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:21:08,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:21:08,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:21:08,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:21:08,845 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:08,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:21:08,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:21:08,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:21:08,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:21:08,877 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:21:08,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:21:08,878 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:21:08,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:21:08,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:21:08,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:21:08,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:21:08,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:08,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:21:08,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:21:08,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:21:08,881 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:21:08,881 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:09,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:21:09,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:21:09,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:21:09,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:21:09,335 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:21:09,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-12-06 06:21:10,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:21:10,642 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:21:10,642 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-12-06 06:21:10,653 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3fb6438/36a2d85d6b234d0089980e0753bc76fd/FLAG7d4aedfa2 [2022-12-06 06:21:10,668 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3fb6438/36a2d85d6b234d0089980e0753bc76fd [2022-12-06 06:21:10,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:21:10,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:21:10,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:10,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:21:10,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:21:10,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:10" (1/1) ... [2022-12-06 06:21:10,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39310975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:10, skipping insertion in model container [2022-12-06 06:21:10,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:10" (1/1) ... [2022-12-06 06:21:10,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:21:10,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:21:10,932 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/mix025_pso.opt_rmo.opt.i[999,1012] [2022-12-06 06:21:11,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:11,188 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:21:11,200 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/mix025_pso.opt_rmo.opt.i[999,1012] [2022-12-06 06:21:11,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:11,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:11,299 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:21:11,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:11 WrapperNode [2022-12-06 06:21:11,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:11,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:11,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:21:11,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:21:11,307 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:11" (1/1) ... [2022-12-06 06:21:11,336 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:11" (1/1) ... [2022-12-06 06:21:11,367 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-06 06:21:11,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:11,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:21:11,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:21:11,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:21:11,376 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:11" (1/1) ... [2022-12-06 06:21:11,376 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:11" (1/1) ... [2022-12-06 06:21:11,391 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:11" (1/1) ... [2022-12-06 06:21:11,392 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:11" (1/1) ... [2022-12-06 06:21:11,397 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:11" (1/1) ... [2022-12-06 06:21:11,399 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:11" (1/1) ... [2022-12-06 06:21:11,400 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:11" (1/1) ... [2022-12-06 06:21:11,401 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:11" (1/1) ... [2022-12-06 06:21:11,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:21:11,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:21:11,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:21:11,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:21:11,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:11" (1/1) ... [2022-12-06 06:21:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:11,482 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:11,499 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:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:21:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:21:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:21:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:21:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:21:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:21:11,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:21:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:21:11,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:21:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:21:11,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:21:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:21:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:21:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:21:11,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:21:11,539 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:11,672 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:21:11,674 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:21:11,947 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:21:12,041 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:21:12,041 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:21:12,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:12 BoogieIcfgContainer [2022-12-06 06:21:12,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:21:12,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:21:12,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:21:12,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:21:12,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:21:10" (1/3) ... [2022-12-06 06:21:12,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446d238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:12, skipping insertion in model container [2022-12-06 06:21:12,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:11" (2/3) ... [2022-12-06 06:21:12,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446d238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:12, skipping insertion in model container [2022-12-06 06:21:12,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:12" (3/3) ... [2022-12-06 06:21:12,051 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2022-12-06 06:21:12,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:21:12,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:21:12,069 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:21:12,116 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:21:12,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:21:12,189 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:21:12,189 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:12,195 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 56 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:21:12,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:21:12,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:12,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:12,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:12,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:12,244 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:21:12,244 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:12,245 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 56 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:21:12,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:21:12,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-06 06:21:15,682 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-06 06:21:15,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:21:15,715 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;@4eea04e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:21:15,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:21:15,718 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:21:15,718 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:15,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:15,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:21:15,720 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:21:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 443750756, now seen corresponding path program 1 times [2022-12-06 06:21:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:15,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378975298] [2022-12-06 06:21:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:16,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378975298] [2022-12-06 06:21:16,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378975298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:16,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:16,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:21:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819464265] [2022-12-06 06:21:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:16,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:21:16,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:21:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:21:16,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:21:16,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:21:16,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:16,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:21:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:16,335 INFO L130 PetriNetUnfolder]: 879/1388 cut-off events. [2022-12-06 06:21:16,335 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:21:16,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1388 events. 879/1388 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6495 event pairs, 240 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 2744. Up to 1060 conditions per place. [2022-12-06 06:21:16,378 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 06:21:16,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 06:21:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:21:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:21:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:21:16,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 06:21:16,387 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:21:16,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 06:21:16,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:21:16,391 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 06:21:16,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 06:21:16,395 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:21:16,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:16,396 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 06:21:16,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:16,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:16,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 06:21:16,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:21:16,403 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:21:16,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:16,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:21:16,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:21:16,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 06:21:16,473 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:16,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 06:21:16,476 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:21:16,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:21:16,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:16,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:16,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:21:16,480 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:21:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 273709557, now seen corresponding path program 1 times [2022-12-06 06:21:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:16,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813126214] [2022-12-06 06:21:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:16,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:16,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813126214] [2022-12-06 06:21:16,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813126214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:16,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:16,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:21:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902538073] [2022-12-06 06:21:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:16,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:21:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:16,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:21:16,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:21:16,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:21:16,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:16,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:16,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:21:16,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:17,002 INFO L130 PetriNetUnfolder]: 1531/2326 cut-off events. [2022-12-06 06:21:17,002 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 06:21:17,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 2326 events. 1531/2326 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10818 event pairs, 457 based on Foata normal form. 76/2402 useless extension candidates. Maximal degree in co-relation 4810. Up to 1560 conditions per place. [2022-12-06 06:21:17,012 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2022-12-06 06:21:17,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 172 flow [2022-12-06 06:21:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:21:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:21:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 06:21:17,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-06 06:21:17,013 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 40 transitions. [2022-12-06 06:21:17,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 172 flow [2022-12-06 06:21:17,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:17,015 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 94 flow [2022-12-06 06:21:17,015 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 06:21:17,016 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-06 06:21:17,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:17,016 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 94 flow [2022-12-06 06:21:17,016 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:17,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:17,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 94 flow [2022-12-06 06:21:17,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 94 flow [2022-12-06 06:21:17,031 INFO L130 PetriNetUnfolder]: 38/141 cut-off events. [2022-12-06 06:21:17,031 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 06:21:17,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 141 events. 38/141 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 702 event pairs, 16 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 258. Up to 67 conditions per place. [2022-12-06 06:21:17,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 94 flow [2022-12-06 06:21:17,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 06:21:17,060 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:17,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 06:21:17,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 94 flow [2022-12-06 06:21:17,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:17,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:17,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:17,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:21:17,063 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:21:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -104938033, now seen corresponding path program 1 times [2022-12-06 06:21:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:17,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854713174] [2022-12-06 06:21:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:17,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854713174] [2022-12-06 06:21:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854713174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:17,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:17,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:21:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719157062] [2022-12-06 06:21:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:21:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:21:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:21:17,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:21:17,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:17,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:17,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:21:17,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:17,408 INFO L130 PetriNetUnfolder]: 1159/1858 cut-off events. [2022-12-06 06:21:17,408 INFO L131 PetriNetUnfolder]: For 643/643 co-relation queries the response was YES. [2022-12-06 06:21:17,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 1858 events. 1159/1858 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9014 event pairs, 405 based on Foata normal form. 30/1869 useless extension candidates. Maximal degree in co-relation 4427. Up to 1191 conditions per place. [2022-12-06 06:21:17,420 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 06:21:17,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 180 flow [2022-12-06 06:21:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:21:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:21:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:21:17,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-06 06:21:17,422 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 94 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:21:17,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 180 flow [2022-12-06 06:21:17,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:17,429 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2022-12-06 06:21:17,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 06:21:17,430 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:21:17,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:17,430 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 93 flow [2022-12-06 06:21:17,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:17,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:17,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 93 flow [2022-12-06 06:21:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 93 flow [2022-12-06 06:21:17,445 INFO L130 PetriNetUnfolder]: 26/104 cut-off events. [2022-12-06 06:21:17,445 INFO L131 PetriNetUnfolder]: For 7/10 co-relation queries the response was YES. [2022-12-06 06:21:17,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 104 events. 26/104 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 429 event pairs, 4 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 186. Up to 49 conditions per place. [2022-12-06 06:21:17,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 93 flow [2022-12-06 06:21:17,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 06:21:17,452 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:17,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 06:21:17,453 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2022-12-06 06:21:17,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:17,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:17,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:17,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:21:17,454 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:21:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1048949435, now seen corresponding path program 1 times [2022-12-06 06:21:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:17,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921155785] [2022-12-06 06:21:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921155785] [2022-12-06 06:21:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921155785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:17,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:21:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219488996] [2022-12-06 06:21:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:17,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:21:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:17,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:21:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:21:17,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:21:17,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 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:21:17,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:17,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:21:17,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:17,815 INFO L130 PetriNetUnfolder]: 798/1379 cut-off events. [2022-12-06 06:21:17,815 INFO L131 PetriNetUnfolder]: For 270/278 co-relation queries the response was YES. [2022-12-06 06:21:17,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 1379 events. 798/1379 cut-off events. For 270/278 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7395 event pairs, 149 based on Foata normal form. 142/1484 useless extension candidates. Maximal degree in co-relation 3155. Up to 785 conditions per place. [2022-12-06 06:21:17,823 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 44 selfloop transitions, 7 changer transitions 7/64 dead transitions. [2022-12-06 06:21:17,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 313 flow [2022-12-06 06:21:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:21:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:21:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 06:21:17,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 06:21:17,826 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 67 transitions. [2022-12-06 06:21:17,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 313 flow [2022-12-06 06:21:17,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:17,829 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 141 flow [2022-12-06 06:21:17,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-06 06:21:17,830 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 06:21:17,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:17,830 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 141 flow [2022-12-06 06:21:17,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:17,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:17,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 141 flow [2022-12-06 06:21:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 141 flow [2022-12-06 06:21:17,855 INFO L130 PetriNetUnfolder]: 111/296 cut-off events. [2022-12-06 06:21:17,855 INFO L131 PetriNetUnfolder]: For 161/272 co-relation queries the response was YES. [2022-12-06 06:21:17,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 296 events. 111/296 cut-off events. For 161/272 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1779 event pairs, 44 based on Foata normal form. 4/268 useless extension candidates. Maximal degree in co-relation 759. Up to 160 conditions per place. [2022-12-06 06:21:17,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 141 flow [2022-12-06 06:21:17,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 06:21:17,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:21:17,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 06:21:17,926 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 135 flow [2022-12-06 06:21:17,926 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:21:17,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:17,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:17,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:21:17,927 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:21:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 430326737, now seen corresponding path program 1 times [2022-12-06 06:21:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:17,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847134190] [2022-12-06 06:21:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:18,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847134190] [2022-12-06 06:21:18,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847134190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:18,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:18,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:21:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794730175] [2022-12-06 06:21:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:18,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:21:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:21:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:21:18,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:21:18,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:21:18,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:18,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:21:18,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:18,229 INFO L130 PetriNetUnfolder]: 387/741 cut-off events. [2022-12-06 06:21:18,229 INFO L131 PetriNetUnfolder]: For 372/373 co-relation queries the response was YES. [2022-12-06 06:21:18,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 741 events. 387/741 cut-off events. For 372/373 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3708 event pairs, 70 based on Foata normal form. 79/809 useless extension candidates. Maximal degree in co-relation 2197. Up to 270 conditions per place. [2022-12-06 06:21:18,233 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 48 selfloop transitions, 10 changer transitions 13/77 dead transitions. [2022-12-06 06:21:18,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 77 transitions, 437 flow [2022-12-06 06:21:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:21:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:21:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 06:21:18,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 06:21:18,234 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 135 flow. Second operand 6 states and 81 transitions. [2022-12-06 06:21:18,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 77 transitions, 437 flow [2022-12-06 06:21:18,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 77 transitions, 431 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:18,237 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 197 flow [2022-12-06 06:21:18,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-06 06:21:18,237 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 06:21:18,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:18,238 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 197 flow [2022-12-06 06:21:18,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:18,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:18,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 197 flow [2022-12-06 06:21:18,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 197 flow [2022-12-06 06:21:18,253 INFO L130 PetriNetUnfolder]: 49/182 cut-off events. [2022-12-06 06:21:18,253 INFO L131 PetriNetUnfolder]: For 296/413 co-relation queries the response was YES. [2022-12-06 06:21:18,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 182 events. 49/182 cut-off events. For 296/413 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 946 event pairs, 6 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 605. Up to 102 conditions per place. [2022-12-06 06:21:18,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 197 flow [2022-12-06 06:21:18,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:21:18,312 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:21:18,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 06:21:18,312 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 189 flow [2022-12-06 06:21:18,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:21:18,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:18,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:18,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:21:18,313 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:21:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 144319557, now seen corresponding path program 1 times [2022-12-06 06:21:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:18,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937811673] [2022-12-06 06:21:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:18,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937811673] [2022-12-06 06:21:18,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937811673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:18,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:18,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:21:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895201092] [2022-12-06 06:21:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:18,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:21:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:21:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:21:18,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:21:18,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:18,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:18,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:21:18,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:18,563 INFO L130 PetriNetUnfolder]: 407/786 cut-off events. [2022-12-06 06:21:18,566 INFO L131 PetriNetUnfolder]: For 1030/1045 co-relation queries the response was YES. [2022-12-06 06:21:18,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 786 events. 407/786 cut-off events. For 1030/1045 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3967 event pairs, 60 based on Foata normal form. 17/790 useless extension candidates. Maximal degree in co-relation 2651. Up to 458 conditions per place. [2022-12-06 06:21:18,570 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 44 selfloop transitions, 2 changer transitions 15/65 dead transitions. [2022-12-06 06:21:18,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 65 transitions, 475 flow [2022-12-06 06:21:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:21:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:21:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:21:18,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:21:18,571 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 189 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:21:18,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 65 transitions, 475 flow [2022-12-06 06:21:18,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 418 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 06:21:18,578 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 164 flow [2022-12-06 06:21:18,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-06 06:21:18,580 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 06:21:18,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:18,580 INFO L89 Accepts]: Start accepts. Operand has 42 places, 33 transitions, 164 flow [2022-12-06 06:21:18,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:18,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:18,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 164 flow [2022-12-06 06:21:18,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 164 flow [2022-12-06 06:21:18,602 INFO L130 PetriNetUnfolder]: 65/217 cut-off events. [2022-12-06 06:21:18,602 INFO L131 PetriNetUnfolder]: For 180/200 co-relation queries the response was YES. [2022-12-06 06:21:18,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 217 events. 65/217 cut-off events. For 180/200 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1156 event pairs, 8 based on Foata normal form. 4/216 useless extension candidates. Maximal degree in co-relation 596. Up to 81 conditions per place. [2022-12-06 06:21:18,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 164 flow [2022-12-06 06:21:18,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-06 06:21:18,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:18,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 06:21:18,607 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 164 flow [2022-12-06 06:21:18,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:18,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:18,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:18,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:21:18,608 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:21:18,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash 252779701, now seen corresponding path program 2 times [2022-12-06 06:21:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130230361] [2022-12-06 06:21:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:18,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130230361] [2022-12-06 06:21:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130230361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:21:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705375985] [2022-12-06 06:21:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:18,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:21:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:21:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:21:18,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:21:18,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:21:18,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:18,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:21:18,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:18,981 INFO L130 PetriNetUnfolder]: 335/661 cut-off events. [2022-12-06 06:21:18,982 INFO L131 PetriNetUnfolder]: For 549/550 co-relation queries the response was YES. [2022-12-06 06:21:18,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 661 events. 335/661 cut-off events. For 549/550 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3275 event pairs, 78 based on Foata normal form. 38/690 useless extension candidates. Maximal degree in co-relation 2074. Up to 233 conditions per place. [2022-12-06 06:21:18,985 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 29 selfloop transitions, 10 changer transitions 22/67 dead transitions. [2022-12-06 06:21:18,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 413 flow [2022-12-06 06:21:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:21:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:21:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-06 06:21:18,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-06 06:21:18,986 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 164 flow. Second operand 7 states and 75 transitions. [2022-12-06 06:21:18,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 413 flow [2022-12-06 06:21:18,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 392 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 06:21:18,989 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 172 flow [2022-12-06 06:21:18,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2022-12-06 06:21:18,989 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-06 06:21:18,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:18,989 INFO L89 Accepts]: Start accepts. Operand has 49 places, 31 transitions, 172 flow [2022-12-06 06:21:18,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:18,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:18,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 31 transitions, 172 flow [2022-12-06 06:21:18,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 31 transitions, 172 flow [2022-12-06 06:21:18,999 INFO L130 PetriNetUnfolder]: 25/103 cut-off events. [2022-12-06 06:21:18,999 INFO L131 PetriNetUnfolder]: For 110/115 co-relation queries the response was YES. [2022-12-06 06:21:19,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 103 events. 25/103 cut-off events. For 110/115 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 417 event pairs, 3 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 307. Up to 29 conditions per place. [2022-12-06 06:21:19,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 31 transitions, 172 flow [2022-12-06 06:21:19,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:21:19,778 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:21:19,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 790 [2022-12-06 06:21:19,779 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 168 flow [2022-12-06 06:21:19,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:21:19,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:19,779 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:21:19,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:21:19,780 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:21:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2106163905, now seen corresponding path program 1 times [2022-12-06 06:21:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:19,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821987068] [2022-12-06 06:21:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821987068] [2022-12-06 06:21:19,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821987068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:19,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:19,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:21:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054179943] [2022-12-06 06:21:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:19,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:21:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:19,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:21:19,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:21:19,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:21:19,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 168 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:19,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:19,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:21:19,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:20,032 INFO L130 PetriNetUnfolder]: 252/485 cut-off events. [2022-12-06 06:21:20,033 INFO L131 PetriNetUnfolder]: For 825/825 co-relation queries the response was YES. [2022-12-06 06:21:20,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 485 events. 252/485 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2115 event pairs, 57 based on Foata normal form. 1/486 useless extension candidates. Maximal degree in co-relation 1775. Up to 283 conditions per place. [2022-12-06 06:21:20,035 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 25 selfloop transitions, 3 changer transitions 23/51 dead transitions. [2022-12-06 06:21:20,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 395 flow [2022-12-06 06:21:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:21:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:21:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 06:21:20,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:21:20,038 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 168 flow. Second operand 4 states and 38 transitions. [2022-12-06 06:21:20,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 395 flow [2022-12-06 06:21:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 330 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-06 06:21:20,042 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 120 flow [2022-12-06 06:21:20,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 06:21:20,044 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 06:21:20,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:20,044 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 120 flow [2022-12-06 06:21:20,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:20,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:20,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 120 flow [2022-12-06 06:21:20,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 120 flow [2022-12-06 06:21:20,049 INFO L130 PetriNetUnfolder]: 7/33 cut-off events. [2022-12-06 06:21:20,049 INFO L131 PetriNetUnfolder]: For 49/57 co-relation queries the response was YES. [2022-12-06 06:21:20,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 33 events. 7/33 cut-off events. For 49/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 1 based on Foata normal form. 6/39 useless extension candidates. Maximal degree in co-relation 82. Up to 10 conditions per place. [2022-12-06 06:21:20,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 120 flow [2022-12-06 06:21:20,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 06:21:20,173 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:21:20,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 06:21:20,174 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 114 flow [2022-12-06 06:21:20,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:20,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:20,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:20,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:21:20,175 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:21:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2003904521, now seen corresponding path program 1 times [2022-12-06 06:21:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:20,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619361187] [2022-12-06 06:21:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619361187] [2022-12-06 06:21:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619361187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:20,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:20,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:21:20,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889973412] [2022-12-06 06:21:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:21:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:21:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:21:20,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:21:20,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 114 flow. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:20,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:20,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:21:20,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:20,620 INFO L130 PetriNetUnfolder]: 50/118 cut-off events. [2022-12-06 06:21:20,621 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-06 06:21:20,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 118 events. 50/118 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 0 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 398. Up to 49 conditions per place. [2022-12-06 06:21:20,621 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 31 selfloop transitions, 5 changer transitions 15/51 dead transitions. [2022-12-06 06:21:20,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 361 flow [2022-12-06 06:21:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:21:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:21:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-12-06 06:21:20,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 06:21:20,623 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 114 flow. Second operand 7 states and 36 transitions. [2022-12-06 06:21:20,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 361 flow [2022-12-06 06:21:20,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 346 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:21:20,624 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 127 flow [2022-12-06 06:21:20,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2022-12-06 06:21:20,625 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 06:21:20,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:20,625 INFO L89 Accepts]: Start accepts. Operand has 42 places, 24 transitions, 127 flow [2022-12-06 06:21:20,626 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:20,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:20,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 127 flow [2022-12-06 06:21:20,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 127 flow [2022-12-06 06:21:20,631 INFO L130 PetriNetUnfolder]: 10/43 cut-off events. [2022-12-06 06:21:20,631 INFO L131 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2022-12-06 06:21:20,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 43 events. 10/43 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 101 event pairs, 1 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 120. Up to 14 conditions per place. [2022-12-06 06:21:20,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 127 flow [2022-12-06 06:21:20,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 06:21:20,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:21:20,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 06:21:20,657 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 123 flow [2022-12-06 06:21:20,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:20,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:20,658 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:20,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:21:20,658 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:21:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1811420143, now seen corresponding path program 1 times [2022-12-06 06:21:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:20,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149435257] [2022-12-06 06:21:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:21:20,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:21:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:21:20,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:21:20,768 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:21:20,769 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:21:20,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:21:20,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:21:20,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:21:20,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:21:20,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:21:20,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:21:20,771 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:20,776 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:21:20,776 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:21:20,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:21:20 BasicIcfg [2022-12-06 06:21:20,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:21:20,833 INFO L158 Benchmark]: Toolchain (without parser) took 10157.51ms. Allocated memory was 230.7MB in the beginning and 492.8MB in the end (delta: 262.1MB). Free memory was 206.5MB in the beginning and 417.8MB in the end (delta: -211.3MB). Peak memory consumption was 50.6MB. Max. memory is 8.0GB. [2022-12-06 06:21:20,833 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 230.7MB. Free memory is still 208.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:21:20,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.75ms. Allocated memory is still 230.7MB. Free memory was 206.2MB in the beginning and 180.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:21:20,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.70ms. Allocated memory is still 230.7MB. Free memory was 180.0MB in the beginning and 177.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:21:20,833 INFO L158 Benchmark]: Boogie Preprocessor took 51.11ms. Allocated memory is still 230.7MB. Free memory was 177.4MB in the beginning and 175.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:21:20,834 INFO L158 Benchmark]: RCFGBuilder took 623.56ms. Allocated memory is still 230.7MB. Free memory was 175.8MB in the beginning and 144.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 06:21:20,834 INFO L158 Benchmark]: TraceAbstraction took 8786.69ms. Allocated memory was 230.7MB in the beginning and 492.8MB in the end (delta: 262.1MB). Free memory was 143.8MB in the beginning and 417.8MB in the end (delta: -273.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:21:20,835 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 230.7MB. Free memory is still 208.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 623.75ms. Allocated memory is still 230.7MB. Free memory was 206.2MB in the beginning and 180.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.70ms. Allocated memory is still 230.7MB. Free memory was 180.0MB in the beginning and 177.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.11ms. Allocated memory is still 230.7MB. Free memory was 177.4MB in the beginning and 175.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 623.56ms. Allocated memory is still 230.7MB. Free memory was 175.8MB in the beginning and 144.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8786.69ms. Allocated memory was 230.7MB in the beginning and 492.8MB in the end (delta: 262.1MB). Free memory was 143.8MB in the beginning and 417.8MB in the end (delta: -273.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 114 PlacesBefore, 36 PlacesAfterwards, 106 TransitionsBefore, 27 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1426, independent: 1371, independent conditional: 1371, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1426, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1426, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1426, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1216, independent: 1182, independent conditional: 0, independent unconditional: 1182, 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: 1216, independent: 1164, independent conditional: 0, independent unconditional: 1164, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1426, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1216, unknown conditional: 0, unknown unconditional: 1216] , Statistics on independence cache: Total cache size (in pairs): 1821, Positive cache size: 1787, Positive conditional cache size: 0, Positive unconditional cache size: 1787, 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.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 63, independent conditional: 5, independent unconditional: 58, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 61, dependent conditional: 12, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 80, unknown conditional: 7, unknown unconditional: 73] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 63, Positive conditional cache size: 5, Positive unconditional cache size: 58, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 61, independent conditional: 61, 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: 76, independent: 61, independent conditional: 8, independent unconditional: 53, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 61, independent conditional: 2, independent unconditional: 59, 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: 76, independent: 61, independent conditional: 2, independent unconditional: 59, 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: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 53, independent conditional: 2, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 71, Positive conditional cache size: 5, Positive unconditional cache size: 66, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 63, 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: 79, independent: 63, independent conditional: 2, independent unconditional: 61, 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: 79, independent: 63, independent conditional: 0, independent unconditional: 63, 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: 79, independent: 63, independent conditional: 0, independent unconditional: 63, 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: 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: 79, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 72, Positive conditional cache size: 5, Positive unconditional cache size: 67, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 92, independent conditional: 24, independent unconditional: 68, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 92, independent conditional: 24, independent unconditional: 68, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 92, independent conditional: 24, independent unconditional: 68, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 87, independent conditional: 19, independent unconditional: 68, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 77, Positive conditional cache size: 10, Positive unconditional cache size: 67, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 59, independent conditional: 12, independent unconditional: 47, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 83, Positive conditional cache size: 15, Positive unconditional cache size: 68, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 83, Positive conditional cache size: 15, Positive unconditional cache size: 68, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, 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.8s, 46 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 103, Positive conditional cache size: 15, Positive unconditional cache size: 88, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, 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.1s, 39 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 31, independent conditional: 28, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 31, independent conditional: 28, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 31, independent conditional: 28, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 125, Positive conditional cache size: 26, Positive unconditional cache size: 99, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 160, Positive cache size: 127, Positive conditional cache size: 27, Positive unconditional cache size: 100, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t666, ((void *)0), P0, ((void *)0))=-3, t666={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] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t667, ((void *)0), P1, ((void *)0))=-2, t666={5:0}, t667={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] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t668, ((void *)0), P2, ((void *)0))=-1, t666={5:0}, t667={6:0}, t668={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=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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 [L806] 3 __unbuffered_p2_EAX = y [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L746] 1 z = 1 [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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_p0_EAX=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=49, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L812] 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) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 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 [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 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) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 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 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 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 [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 19]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 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: 8.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 10 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:21:20,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...