/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:37:52,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:37:52,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:37:52,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:37:52,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:37:52,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:37:52,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:37:52,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:37:52,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:37:52,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:37:52,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:37:52,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:37:52,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:37:52,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:37:52,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:37:52,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:37:52,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:37:52,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:37:52,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:37:52,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:37:52,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:37:52,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:37:52,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:37:52,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:37:52,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:37:52,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:37:52,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:37:52,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:37:52,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:37:52,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:37:52,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:37:52,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:37:52,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:37:52,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:37:52,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:37:52,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:37:52,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:37:52,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:37:52,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:37:52,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:37:52,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:37:52,370 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:37:52,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:37:52,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:37:52,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:37:52,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:37:52,404 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:37:52,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:37:52,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:37:52,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:37:52,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:37:52,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:37:52,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:37:52,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:37:52,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:37:52,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:37:52,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:37:52,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:37:52,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:37:52,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:37:52,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:37:52,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:37:52,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:37:52,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:52,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:37:52,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:37:52,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:37:52,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:37:52,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:37:52,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:37:52,409 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:37:52,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:37:52,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:37:52,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:37:52,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:37:52,739 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:37:52,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-06 06:37:53,992 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:37:54,239 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:37:54,252 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-06 06:37:54,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd7d5832/d7ae1dca8bed45fa8d6e4a95340c3979/FLAGe77f84551 [2022-12-06 06:37:54,292 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd7d5832/d7ae1dca8bed45fa8d6e4a95340c3979 [2022-12-06 06:37:54,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:37:54,296 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:37:54,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:54,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:37:54,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:37:54,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9b9b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54, skipping insertion in model container [2022-12-06 06:37:54,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:37:54,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:37:54,543 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-06 06:37:54,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:54,760 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:37:54,771 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-06 06:37:54,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:54,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:54,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:54,850 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:37:54,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54 WrapperNode [2022-12-06 06:37:54,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:54,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:54,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:37:54,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:37:54,858 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:37:54" (1/1) ... [2022-12-06 06:37:54,890 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:37:54" (1/1) ... [2022-12-06 06:37:54,933 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 06:37:54,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:54,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:37:54,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:37:54,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:37:54,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,956 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:37:54,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:37:54,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:37:54,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:37:54,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (1/1) ... [2022-12-06 06:37:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:37:55,035 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:37:55,048 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:37:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:37:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:37:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:37:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:37:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:37:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:37:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:37:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:37:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:37:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:37:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:37:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:37:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:37:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:37:55,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:37:55,072 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:37:55,202 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:37:55,204 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:37:55,534 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:37:55,665 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:37:55,665 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:37:55,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:55 BoogieIcfgContainer [2022-12-06 06:37:55,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:37:55,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:37:55,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:37:55,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:37:55,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:37:54" (1/3) ... [2022-12-06 06:37:55,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a085303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:55, skipping insertion in model container [2022-12-06 06:37:55,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:54" (2/3) ... [2022-12-06 06:37:55,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a085303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:55, skipping insertion in model container [2022-12-06 06:37:55,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:55" (3/3) ... [2022-12-06 06:37:55,676 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-06 06:37:55,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:37:55,693 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:37:55,693 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:37:55,759 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:37:55,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:37:55,856 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:37:55,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:55,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:37:55,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:37:55,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 06:37:55,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:55,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:37:55,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 06:37:55,936 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:37:55,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:55,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:37:55,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:37:55,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 06:38:01,097 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 06:38:01,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:38:01,116 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;@34132ec5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:38:01,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:38:01,119 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:38:01,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:01,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:01,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:38:01,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 466670, now seen corresponding path program 1 times [2022-12-06 06:38:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:01,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041656491] [2022-12-06 06:38:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:01,479 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:38:01,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:01,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041656491] [2022-12-06 06:38:01,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041656491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:01,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:01,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153399560] [2022-12-06 06:38:01,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:01,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:01,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:01,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:38:01,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:01,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:01,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:38:01,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:01,873 INFO L130 PetriNetUnfolder]: 882/1448 cut-off events. [2022-12-06 06:38:01,873 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:38:01,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1448 events. 882/1448 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7911 event pairs, 138 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2811. Up to 1078 conditions per place. [2022-12-06 06:38:01,888 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 29 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-06 06:38:01,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 177 flow [2022-12-06 06:38:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 06:38:01,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-06 06:38:01,901 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 53 transitions. [2022-12-06 06:38:01,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 177 flow [2022-12-06 06:38:01,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:38:01,907 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 06:38:01,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 06:38:01,913 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:38:01,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:01,914 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 06:38:01,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:01,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:01,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 06:38:01,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:38:01,933 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:38:01,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:01,933 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 25 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:38:01,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:38:01,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:38:02,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:02,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 06:38:02,026 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:38:02,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:02,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:02,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:02,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:38:02,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash -679666322, now seen corresponding path program 1 times [2022-12-06 06:38:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:02,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894150422] [2022-12-06 06:38:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:02,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:02,767 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:38:02,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:02,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894150422] [2022-12-06 06:38:02,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894150422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:02,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:02,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:02,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232123606] [2022-12-06 06:38:02,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:02,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:02,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:38:02,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:02,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:02,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:38:02,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:03,063 INFO L130 PetriNetUnfolder]: 988/1487 cut-off events. [2022-12-06 06:38:03,064 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-06 06:38:03,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1487 events. 988/1487 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6342 event pairs, 204 based on Foata normal form. 36/1518 useless extension candidates. Maximal degree in co-relation 3102. Up to 1101 conditions per place. [2022-12-06 06:38:03,074 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 30 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2022-12-06 06:38:03,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 166 flow [2022-12-06 06:38:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:38:03,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:38:03,076 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:38:03,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 166 flow [2022-12-06 06:38:03,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:03,078 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 108 flow [2022-12-06 06:38:03,078 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-06 06:38:03,079 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:38:03,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:03,080 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 108 flow [2022-12-06 06:38:03,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:03,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:03,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 108 flow [2022-12-06 06:38:03,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 108 flow [2022-12-06 06:38:03,123 INFO L130 PetriNetUnfolder]: 131/244 cut-off events. [2022-12-06 06:38:03,123 INFO L131 PetriNetUnfolder]: For 28/35 co-relation queries the response was YES. [2022-12-06 06:38:03,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 244 events. 131/244 cut-off events. For 28/35 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1076 event pairs, 72 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 545. Up to 190 conditions per place. [2022-12-06 06:38:03,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 108 flow [2022-12-06 06:38:03,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 06:38:03,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [408] L2-1-->L834: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_88 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_88 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_204 256) 0))))) (and (= v_~z~0_124 (ite .cse0 v_~z$w_buff0~0_115 (ite .cse1 v_~z$w_buff1~0_103 v_~z~0_125))) (= v_~z$r_buff0_thd0~0_87 (ite .cse2 0 v_~z$r_buff0_thd0~0_88)) (= v_~z$w_buff1_used~0_171 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_172)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_87 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_171 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_88) v_~z$r_buff1_thd0~0_87) (= (ite .cse0 0 v_~z$w_buff0_used~0_204) v_~z$w_buff0_used~0_203)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_204, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_125} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_87, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_203, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_171, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_124} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-06 06:38:03,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [339] L794-->L801: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd3~0_26 256) 0)))) (let ((.cse2 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_115 256) 0)))) (.cse3 (and .cse5 .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_132 256) 0)) .cse5))) (and (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_27 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$w_buff1_used~0_114 256) 0)))) 0 v_~z$r_buff1_thd3~0_26) v_~z$r_buff1_thd3~0_25) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_115) v_~z$w_buff1_used~0_114) (= v_~z~0_73 (ite .cse4 v_~z$w_buff0~0_55 (ite .cse2 v_~z$w_buff1~0_58 v_~z~0_74))) (= (ite .cse3 0 v_~z$r_buff0_thd3~0_28) v_~z$r_buff0_thd3~0_27) (= v_~z$w_buff0_used~0_131 (ite .cse4 0 v_~z$w_buff0_used~0_132))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_115, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_74} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_73} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-06 06:38:03,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [356] $Ultimate##0-->L771: Formula: (and (= v_~x~0_19 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 06:38:03,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_110 256) 0))))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_45 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_58))) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite .cse0 0 v_~z$w_buff0_used~0_110) v_~z$w_buff0_used~0_109) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_24))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_110, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-06 06:38:03,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:03,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 496 [2022-12-06 06:38:03,577 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 110 flow [2022-12-06 06:38:03,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:03,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:03,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:03,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:38:03,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 405181272, now seen corresponding path program 1 times [2022-12-06 06:38:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:03,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059402244] [2022-12-06 06:38:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:03,786 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:38:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059402244] [2022-12-06 06:38:03,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059402244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:03,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:03,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110980487] [2022-12-06 06:38:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:03,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:03,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:03,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:03,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:03,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:38:03,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 110 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:38:03,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:03,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:38:03,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:03,973 INFO L130 PetriNetUnfolder]: 708/1092 cut-off events. [2022-12-06 06:38:03,973 INFO L131 PetriNetUnfolder]: For 805/833 co-relation queries the response was YES. [2022-12-06 06:38:03,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1092 events. 708/1092 cut-off events. For 805/833 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4696 event pairs, 232 based on Foata normal form. 6/1093 useless extension candidates. Maximal degree in co-relation 3067. Up to 994 conditions per place. [2022-12-06 06:38:03,981 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-06 06:38:03,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 250 flow [2022-12-06 06:38:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:38:03,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 06:38:03,983 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 110 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:38:03,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 250 flow [2022-12-06 06:38:03,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:03,985 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 171 flow [2022-12-06 06:38:03,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-06 06:38:03,986 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2022-12-06 06:38:03,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:03,986 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 171 flow [2022-12-06 06:38:03,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:03,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:03,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 171 flow [2022-12-06 06:38:03,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 171 flow [2022-12-06 06:38:04,028 INFO L130 PetriNetUnfolder]: 127/236 cut-off events. [2022-12-06 06:38:04,029 INFO L131 PetriNetUnfolder]: For 206/224 co-relation queries the response was YES. [2022-12-06 06:38:04,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 236 events. 127/236 cut-off events. For 206/224 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1020 event pairs, 48 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 611. Up to 186 conditions per place. [2022-12-06 06:38:04,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 171 flow [2022-12-06 06:38:04,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:38:04,038 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:04,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 06:38:04,039 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 171 flow [2022-12-06 06:38:04,039 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:38:04,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:04,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:04,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:38:04,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1257143833, now seen corresponding path program 1 times [2022-12-06 06:38:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:04,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504064812] [2022-12-06 06:38:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:04,233 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:38:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:04,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504064812] [2022-12-06 06:38:04,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504064812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:04,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:04,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965614579] [2022-12-06 06:38:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:04,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:04,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:04,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:38:04,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:04,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:04,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:38:04,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:04,476 INFO L130 PetriNetUnfolder]: 925/1449 cut-off events. [2022-12-06 06:38:04,476 INFO L131 PetriNetUnfolder]: For 1309/1330 co-relation queries the response was YES. [2022-12-06 06:38:04,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4286 conditions, 1449 events. 925/1449 cut-off events. For 1309/1330 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7185 event pairs, 380 based on Foata normal form. 36/1465 useless extension candidates. Maximal degree in co-relation 4271. Up to 823 conditions per place. [2022-12-06 06:38:04,486 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 32 selfloop transitions, 8 changer transitions 2/44 dead transitions. [2022-12-06 06:38:04,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 296 flow [2022-12-06 06:38:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:38:04,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 06:38:04,489 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 171 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:38:04,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 296 flow [2022-12-06 06:38:04,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:04,499 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 174 flow [2022-12-06 06:38:04,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-06 06:38:04,501 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 06:38:04,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:04,501 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 174 flow [2022-12-06 06:38:04,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:04,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:04,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 174 flow [2022-12-06 06:38:04,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 174 flow [2022-12-06 06:38:04,550 INFO L130 PetriNetUnfolder]: 124/268 cut-off events. [2022-12-06 06:38:04,551 INFO L131 PetriNetUnfolder]: For 419/436 co-relation queries the response was YES. [2022-12-06 06:38:04,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 268 events. 124/268 cut-off events. For 419/436 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1421 event pairs, 64 based on Foata normal form. 3/253 useless extension candidates. Maximal degree in co-relation 681. Up to 202 conditions per place. [2022-12-06 06:38:04,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 174 flow [2022-12-06 06:38:04,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 06:38:04,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L751-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_97 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_427 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_90 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_428 256) 0)) .cse5)) (.cse1 (and .cse4 .cse5)) (.cse2 (and (not (= 0 (mod v_~z$w_buff1_used~0_388 256))) .cse3))) (and (= v_~z$w_buff0_used~0_427 (ite .cse0 0 v_~z$w_buff0_used~0_428)) (= v_~z$r_buff0_thd2~0_89 (ite .cse1 0 v_~z$r_buff0_thd2~0_90)) (= v_~z~0_345 (ite .cse0 v_~z$w_buff0~0_270 (ite .cse2 v_~z$w_buff1~0_252 v_~z~0_346))) (= v_~z$w_buff1_used~0_387 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_388)) (= v_~x~0_115 1) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_387 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_89 256) 0)))) 0 v_~z$r_buff1_thd2~0_97) v_~z$r_buff1_thd2~0_96)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_428, ~z$w_buff0~0=v_~z$w_buff0~0_270, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_97, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_388, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~z~0=v_~z~0_346, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_90} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_427, ~z$w_buff0~0=v_~z$w_buff0~0_270, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_96, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_387, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~z~0=v_~z~0_345, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0, ~x~0] and [356] $Ultimate##0-->L771: Formula: (and (= v_~x~0_19 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 06:38:04,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:04,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 06:38:04,661 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 179 flow [2022-12-06 06:38:04,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:04,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:04,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:04,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:38:04,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 771946462, now seen corresponding path program 1 times [2022-12-06 06:38:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:04,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013858840] [2022-12-06 06:38:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:04,807 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:38:04,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013858840] [2022-12-06 06:38:04,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013858840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:04,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:04,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:04,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288114795] [2022-12-06 06:38:04,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:04,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:04,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:04,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:04,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:38:04,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:04,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:04,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:38:04,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:05,157 INFO L130 PetriNetUnfolder]: 1342/2124 cut-off events. [2022-12-06 06:38:05,158 INFO L131 PetriNetUnfolder]: For 3078/3093 co-relation queries the response was YES. [2022-12-06 06:38:05,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6052 conditions, 2124 events. 1342/2124 cut-off events. For 3078/3093 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11108 event pairs, 283 based on Foata normal form. 60/2174 useless extension candidates. Maximal degree in co-relation 6036. Up to 961 conditions per place. [2022-12-06 06:38:05,169 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 33 selfloop transitions, 3 changer transitions 13/51 dead transitions. [2022-12-06 06:38:05,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 366 flow [2022-12-06 06:38:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 06:38:05,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 06:38:05,177 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 179 flow. Second operand 4 states and 56 transitions. [2022-12-06 06:38:05,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 366 flow [2022-12-06 06:38:05,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 353 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:05,181 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 124 flow [2022-12-06 06:38:05,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=124, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2022-12-06 06:38:05,184 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 06:38:05,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:05,184 INFO L89 Accepts]: Start accepts. Operand has 41 places, 24 transitions, 124 flow [2022-12-06 06:38:05,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:05,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:05,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 124 flow [2022-12-06 06:38:05,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 124 flow [2022-12-06 06:38:05,210 INFO L130 PetriNetUnfolder]: 70/195 cut-off events. [2022-12-06 06:38:05,211 INFO L131 PetriNetUnfolder]: For 245/246 co-relation queries the response was YES. [2022-12-06 06:38:05,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 195 events. 70/195 cut-off events. For 245/246 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1036 event pairs, 62 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 489. Up to 128 conditions per place. [2022-12-06 06:38:05,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 124 flow [2022-12-06 06:38:05,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 06:38:05,216 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:05,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 06:38:05,218 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 124 flow [2022-12-06 06:38:05,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:05,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:05,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:05,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:38:05,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1840609153, now seen corresponding path program 1 times [2022-12-06 06:38:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517899213] [2022-12-06 06:38:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:05,610 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:38:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:05,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517899213] [2022-12-06 06:38:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517899213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:05,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:05,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256388863] [2022-12-06 06:38:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:05,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:05,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:38:05,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:05,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:05,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:38:05,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:05,837 INFO L130 PetriNetUnfolder]: 825/1307 cut-off events. [2022-12-06 06:38:05,838 INFO L131 PetriNetUnfolder]: For 1835/1835 co-relation queries the response was YES. [2022-12-06 06:38:05,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 1307 events. 825/1307 cut-off events. For 1835/1835 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5681 event pairs, 535 based on Foata normal form. 1/1307 useless extension candidates. Maximal degree in co-relation 3948. Up to 1267 conditions per place. [2022-12-06 06:38:05,846 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 30 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2022-12-06 06:38:05,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 262 flow [2022-12-06 06:38:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:38:05,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:38:05,848 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 124 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:38:05,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 262 flow [2022-12-06 06:38:05,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 240 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 06:38:05,852 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 163 flow [2022-12-06 06:38:05,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-06 06:38:05,852 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 06:38:05,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:05,853 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 163 flow [2022-12-06 06:38:05,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:05,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:05,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 163 flow [2022-12-06 06:38:05,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 163 flow [2022-12-06 06:38:05,903 INFO L130 PetriNetUnfolder]: 120/291 cut-off events. [2022-12-06 06:38:05,904 INFO L131 PetriNetUnfolder]: For 404/416 co-relation queries the response was YES. [2022-12-06 06:38:05,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 291 events. 120/291 cut-off events. For 404/416 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1592 event pairs, 69 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 777. Up to 184 conditions per place. [2022-12-06 06:38:05,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 163 flow [2022-12-06 06:38:05,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 06:38:05,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [408] L2-1-->L834: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_88 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_88 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_204 256) 0))))) (and (= v_~z~0_124 (ite .cse0 v_~z$w_buff0~0_115 (ite .cse1 v_~z$w_buff1~0_103 v_~z~0_125))) (= v_~z$r_buff0_thd0~0_87 (ite .cse2 0 v_~z$r_buff0_thd0~0_88)) (= v_~z$w_buff1_used~0_171 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_172)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_87 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_171 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_88) v_~z$r_buff1_thd0~0_87) (= (ite .cse0 0 v_~z$w_buff0_used~0_204) v_~z$w_buff0_used~0_203)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_204, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_125} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_87, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_203, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_171, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_124} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-06 06:38:06,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [453] $Ultimate##0-->L794: Formula: (and (= v_~z~0_365 1) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_89) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_51} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_365, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:06,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [452] $Ultimate##0-->L794: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= v_~z~0_363 1) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_87)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_49} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~z~0=v_~z~0_363, ~y~0=v_~y~0_49} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:06,216 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:38:06,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-06 06:38:06,217 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 177 flow [2022-12-06 06:38:06,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:06,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:06,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:06,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:38:06,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash 814096480, now seen corresponding path program 1 times [2022-12-06 06:38:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:06,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54790738] [2022-12-06 06:38:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:06,785 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:38:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:06,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54790738] [2022-12-06 06:38:06,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54790738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:06,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:06,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478992102] [2022-12-06 06:38:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:06,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:38:06,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:38:06,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:06,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:38:06,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:07,077 INFO L130 PetriNetUnfolder]: 833/1319 cut-off events. [2022-12-06 06:38:07,077 INFO L131 PetriNetUnfolder]: For 1933/1946 co-relation queries the response was YES. [2022-12-06 06:38:07,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 1319 events. 833/1319 cut-off events. For 1933/1946 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5890 event pairs, 411 based on Foata normal form. 8/1326 useless extension candidates. Maximal degree in co-relation 4270. Up to 1160 conditions per place. [2022-12-06 06:38:07,089 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 42 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2022-12-06 06:38:07,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 381 flow [2022-12-06 06:38:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 06:38:07,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-06 06:38:07,091 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 177 flow. Second operand 4 states and 59 transitions. [2022-12-06 06:38:07,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 381 flow [2022-12-06 06:38:07,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 379 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:38:07,095 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 244 flow [2022-12-06 06:38:07,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-06 06:38:07,097 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 06:38:07,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:07,097 INFO L89 Accepts]: Start accepts. Operand has 46 places, 36 transitions, 244 flow [2022-12-06 06:38:07,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:07,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:07,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 244 flow [2022-12-06 06:38:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 244 flow [2022-12-06 06:38:07,136 INFO L130 PetriNetUnfolder]: 115/277 cut-off events. [2022-12-06 06:38:07,137 INFO L131 PetriNetUnfolder]: For 919/963 co-relation queries the response was YES. [2022-12-06 06:38:07,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 277 events. 115/277 cut-off events. For 919/963 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1433 event pairs, 55 based on Foata normal form. 3/262 useless extension candidates. Maximal degree in co-relation 968. Up to 184 conditions per place. [2022-12-06 06:38:07,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 244 flow [2022-12-06 06:38:07,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 06:38:07,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:07,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 06:38:07,188 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 250 flow [2022-12-06 06:38:07,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:38:07,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:07,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:07,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:38:07,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:07,189 INFO L85 PathProgramCache]: Analyzing trace with hash 771957033, now seen corresponding path program 1 times [2022-12-06 06:38:07,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:07,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900944929] [2022-12-06 06:38:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:07,614 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:38:07,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:07,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900944929] [2022-12-06 06:38:07,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900944929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:07,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:07,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325435796] [2022-12-06 06:38:07,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:07,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:07,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:38:07,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:38:07,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:07,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:38:07,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:07,871 INFO L130 PetriNetUnfolder]: 790/1271 cut-off events. [2022-12-06 06:38:07,871 INFO L131 PetriNetUnfolder]: For 3256/3262 co-relation queries the response was YES. [2022-12-06 06:38:07,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 1271 events. 790/1271 cut-off events. For 3256/3262 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5803 event pairs, 323 based on Foata normal form. 13/1283 useless extension candidates. Maximal degree in co-relation 4656. Up to 1130 conditions per place. [2022-12-06 06:38:07,883 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 41 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-06 06:38:07,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 405 flow [2022-12-06 06:38:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:38:07,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-06 06:38:07,885 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 250 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:38:07,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 405 flow [2022-12-06 06:38:07,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 396 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:07,892 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 263 flow [2022-12-06 06:38:07,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-06 06:38:07,892 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-06 06:38:07,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:07,893 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 263 flow [2022-12-06 06:38:07,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:07,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:07,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 263 flow [2022-12-06 06:38:07,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 263 flow [2022-12-06 06:38:07,931 INFO L130 PetriNetUnfolder]: 109/277 cut-off events. [2022-12-06 06:38:07,931 INFO L131 PetriNetUnfolder]: For 750/779 co-relation queries the response was YES. [2022-12-06 06:38:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 277 events. 109/277 cut-off events. For 750/779 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1510 event pairs, 59 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 928. Up to 177 conditions per place. [2022-12-06 06:38:07,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 263 flow [2022-12-06 06:38:07,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 06:38:07,943 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:07,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 06:38:07,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 263 flow [2022-12-06 06:38:07,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:38:07,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:07,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:07,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:38:07,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1839238364, now seen corresponding path program 1 times [2022-12-06 06:38:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:07,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964010301] [2022-12-06 06:38:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:08,463 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:38:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:08,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964010301] [2022-12-06 06:38:08,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964010301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:08,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:08,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586148807] [2022-12-06 06:38:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:08,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:08,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 06:38:08,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 263 flow. Second operand has 5 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:38:08,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:08,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 06:38:08,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:08,843 INFO L130 PetriNetUnfolder]: 988/1597 cut-off events. [2022-12-06 06:38:08,844 INFO L131 PetriNetUnfolder]: For 4214/4214 co-relation queries the response was YES. [2022-12-06 06:38:08,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5768 conditions, 1597 events. 988/1597 cut-off events. For 4214/4214 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7721 event pairs, 235 based on Foata normal form. 18/1615 useless extension candidates. Maximal degree in co-relation 5744. Up to 992 conditions per place. [2022-12-06 06:38:08,858 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 51 selfloop transitions, 21 changer transitions 0/73 dead transitions. [2022-12-06 06:38:08,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 590 flow [2022-12-06 06:38:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:38:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:38:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 06:38:08,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 06:38:08,861 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 263 flow. Second operand 6 states and 70 transitions. [2022-12-06 06:38:08,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 590 flow [2022-12-06 06:38:08,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 572 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:08,866 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 424 flow [2022-12-06 06:38:08,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-06 06:38:08,867 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-06 06:38:08,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:08,867 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 424 flow [2022-12-06 06:38:08,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:08,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:08,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 424 flow [2022-12-06 06:38:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 424 flow [2022-12-06 06:38:08,913 INFO L130 PetriNetUnfolder]: 124/323 cut-off events. [2022-12-06 06:38:08,914 INFO L131 PetriNetUnfolder]: For 1217/1277 co-relation queries the response was YES. [2022-12-06 06:38:08,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 323 events. 124/323 cut-off events. For 1217/1277 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1878 event pairs, 23 based on Foata normal form. 9/326 useless extension candidates. Maximal degree in co-relation 1313. Up to 204 conditions per place. [2022-12-06 06:38:08,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 424 flow [2022-12-06 06:38:08,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 06:38:08,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] $Ultimate##0-->L771: Formula: (and (= v_~x~0_19 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-06 06:38:09,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->L794: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_29 |v_P2Thread1of1ForFork1_#in~arg.offset_29|) (= v_~z~0_377 1) (= v_P2Thread1of1ForFork1_~arg.base_29 |v_P2Thread1of1ForFork1_#in~arg.base_29|) (= v_~y~0_59 v_~__unbuffered_p2_EAX~0_97)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, ~y~0=v_~y~0_59} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_29, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, ~z~0=v_~z~0_377, ~y~0=v_~y~0_59} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-06 06:38:09,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] L771-->L794: Formula: (and (= v_~y~0_55 1) (= v_P2Thread1of1ForFork1_~arg.offset_25 |v_P2Thread1of1ForFork1_#in~arg.offset_25|) (= v_P2Thread1of1ForFork1_~arg.base_25 |v_P2Thread1of1ForFork1_#in~arg.base_25|) (= v_~y~0_55 v_~__unbuffered_p2_EAX~0_93) (= v_~z~0_373 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_25, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_93, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~z~0=v_~z~0_373, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-06 06:38:09,341 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:09,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 06:38:09,342 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 440 flow [2022-12-06 06:38:09,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:38:09,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:09,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:09,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:38:09,343 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 304873387, now seen corresponding path program 1 times [2022-12-06 06:38:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:09,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57901776] [2022-12-06 06:38:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:09,803 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:38:09,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:09,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57901776] [2022-12-06 06:38:09,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57901776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:09,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:09,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072148852] [2022-12-06 06:38:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:09,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:09,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:38:09,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:38:09,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:09,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:38:09,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:10,130 INFO L130 PetriNetUnfolder]: 1000/1622 cut-off events. [2022-12-06 06:38:10,130 INFO L131 PetriNetUnfolder]: For 6383/6383 co-relation queries the response was YES. [2022-12-06 06:38:10,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6774 conditions, 1622 events. 1000/1622 cut-off events. For 6383/6383 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7906 event pairs, 372 based on Foata normal form. 4/1625 useless extension candidates. Maximal degree in co-relation 6748. Up to 1400 conditions per place. [2022-12-06 06:38:10,154 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 54 selfloop transitions, 15 changer transitions 1/72 dead transitions. [2022-12-06 06:38:10,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 727 flow [2022-12-06 06:38:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 06:38:10,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2022-12-06 06:38:10,156 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 440 flow. Second operand 4 states and 61 transitions. [2022-12-06 06:38:10,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 727 flow [2022-12-06 06:38:10,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 713 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:10,166 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 539 flow [2022-12-06 06:38:10,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=539, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-06 06:38:10,168 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2022-12-06 06:38:10,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:10,168 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 539 flow [2022-12-06 06:38:10,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:10,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:10,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 539 flow [2022-12-06 06:38:10,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 539 flow [2022-12-06 06:38:10,216 INFO L130 PetriNetUnfolder]: 136/339 cut-off events. [2022-12-06 06:38:10,217 INFO L131 PetriNetUnfolder]: For 1576/1677 co-relation queries the response was YES. [2022-12-06 06:38:10,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 339 events. 136/339 cut-off events. For 1576/1677 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1930 event pairs, 30 based on Foata normal form. 8/339 useless extension candidates. Maximal degree in co-relation 1541. Up to 219 conditions per place. [2022-12-06 06:38:10,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 539 flow [2022-12-06 06:38:10,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 06:38:10,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:10,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 06:38:10,255 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 542 flow [2022-12-06 06:38:10,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:38:10,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:10,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:10,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:38:10,256 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1840486734, now seen corresponding path program 1 times [2022-12-06 06:38:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:10,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696694725] [2022-12-06 06:38:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:10,807 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:38:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:10,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696694725] [2022-12-06 06:38:10,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696694725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:10,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:10,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503008607] [2022-12-06 06:38:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:10,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:10,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 06:38:10,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:38:10,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:10,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 06:38:10,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:11,203 INFO L130 PetriNetUnfolder]: 956/1558 cut-off events. [2022-12-06 06:38:11,203 INFO L131 PetriNetUnfolder]: For 7505/7505 co-relation queries the response was YES. [2022-12-06 06:38:11,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6926 conditions, 1558 events. 956/1558 cut-off events. For 7505/7505 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7648 event pairs, 237 based on Foata normal form. 12/1569 useless extension candidates. Maximal degree in co-relation 6899. Up to 1086 conditions per place. [2022-12-06 06:38:11,215 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 50 selfloop transitions, 18 changer transitions 10/80 dead transitions. [2022-12-06 06:38:11,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 852 flow [2022-12-06 06:38:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 06:38:11,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 06:38:11,216 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 542 flow. Second operand 4 states and 64 transitions. [2022-12-06 06:38:11,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 852 flow [2022-12-06 06:38:11,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 829 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:11,235 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 554 flow [2022-12-06 06:38:11,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=554, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2022-12-06 06:38:11,236 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2022-12-06 06:38:11,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:11,237 INFO L89 Accepts]: Start accepts. Operand has 58 places, 52 transitions, 554 flow [2022-12-06 06:38:11,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:11,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:11,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 52 transitions, 554 flow [2022-12-06 06:38:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 554 flow [2022-12-06 06:38:11,276 INFO L130 PetriNetUnfolder]: 91/255 cut-off events. [2022-12-06 06:38:11,276 INFO L131 PetriNetUnfolder]: For 1259/1348 co-relation queries the response was YES. [2022-12-06 06:38:11,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 255 events. 91/255 cut-off events. For 1259/1348 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1394 event pairs, 15 based on Foata normal form. 13/262 useless extension candidates. Maximal degree in co-relation 1202. Up to 156 conditions per place. [2022-12-06 06:38:11,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 52 transitions, 554 flow [2022-12-06 06:38:11,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 06:38:11,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:11,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 06:38:11,433 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 562 flow [2022-12-06 06:38:11,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:38:11,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:11,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:11,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:38:11,434 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1840486517, now seen corresponding path program 1 times [2022-12-06 06:38:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:11,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017418348] [2022-12-06 06:38:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:11,934 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:38:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:11,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017418348] [2022-12-06 06:38:11,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017418348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:11,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:11,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981307849] [2022-12-06 06:38:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:11,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:11,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 06:38:11,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:38:11,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:11,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 06:38:11,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:12,333 INFO L130 PetriNetUnfolder]: 816/1375 cut-off events. [2022-12-06 06:38:12,333 INFO L131 PetriNetUnfolder]: For 7325/7325 co-relation queries the response was YES. [2022-12-06 06:38:12,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 1375 events. 816/1375 cut-off events. For 7325/7325 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6841 event pairs, 249 based on Foata normal form. 6/1380 useless extension candidates. Maximal degree in co-relation 6310. Up to 1007 conditions per place. [2022-12-06 06:38:12,349 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 56 selfloop transitions, 25 changer transitions 5/88 dead transitions. [2022-12-06 06:38:12,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 961 flow [2022-12-06 06:38:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:38:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:38:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 06:38:12,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-06 06:38:12,351 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 562 flow. Second operand 6 states and 78 transitions. [2022-12-06 06:38:12,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 961 flow [2022-12-06 06:38:12,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 910 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 06:38:12,361 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 716 flow [2022-12-06 06:38:12,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=716, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2022-12-06 06:38:12,362 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2022-12-06 06:38:12,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:12,363 INFO L89 Accepts]: Start accepts. Operand has 63 places, 62 transitions, 716 flow [2022-12-06 06:38:12,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:12,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:12,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 62 transitions, 716 flow [2022-12-06 06:38:12,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 62 transitions, 716 flow [2022-12-06 06:38:12,405 INFO L130 PetriNetUnfolder]: 94/270 cut-off events. [2022-12-06 06:38:12,405 INFO L131 PetriNetUnfolder]: For 1643/1750 co-relation queries the response was YES. [2022-12-06 06:38:12,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 270 events. 94/270 cut-off events. For 1643/1750 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1533 event pairs, 10 based on Foata normal form. 8/270 useless extension candidates. Maximal degree in co-relation 1416. Up to 165 conditions per place. [2022-12-06 06:38:12,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 62 transitions, 716 flow [2022-12-06 06:38:12,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:38:12,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] $Ultimate##0-->L794: Formula: (and (= 2 v_~x~0_123) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~y~0_61 1) (= v_~z~0_386 1) (= v_P2Thread1of1ForFork1_~arg.base_31 |v_P2Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= v_~y~0_61 v_~__unbuffered_p2_EAX~0_99) (= v_P2Thread1of1ForFork1_~arg.offset_31 |v_P2Thread1of1ForFork1_#in~arg.offset_31|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_31, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_31, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~z~0=v_~z~0_386, ~y~0=v_~y~0_61, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~x~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-06 06:38:12,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] $Ultimate##0-->L794: Formula: (and (= 2 v_~x~0_123) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~y~0_61 1) (= v_~z~0_386 1) (= v_P2Thread1of1ForFork1_~arg.base_31 |v_P2Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= v_~y~0_61 v_~__unbuffered_p2_EAX~0_99) (= v_P2Thread1of1ForFork1_~arg.offset_31 |v_P2Thread1of1ForFork1_#in~arg.offset_31|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_31, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_31, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~z~0=v_~z~0_386, ~y~0=v_~y~0_61, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~x~0] and [408] L2-1-->L834: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_88 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_88 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_204 256) 0))))) (and (= v_~z~0_124 (ite .cse0 v_~z$w_buff0~0_115 (ite .cse1 v_~z$w_buff1~0_103 v_~z~0_125))) (= v_~z$r_buff0_thd0~0_87 (ite .cse2 0 v_~z$r_buff0_thd0~0_88)) (= v_~z$w_buff1_used~0_171 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_172)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_87 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_171 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_88) v_~z$r_buff1_thd0~0_87) (= (ite .cse0 0 v_~z$w_buff0_used~0_204) v_~z$w_buff0_used~0_203)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_204, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_125} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_87, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_203, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_171, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_124} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-06 06:38:12,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] $Ultimate##0-->L794: Formula: (and (= 2 v_~x~0_123) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~y~0_61 1) (= v_~z~0_386 1) (= v_P2Thread1of1ForFork1_~arg.base_31 |v_P2Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= v_~y~0_61 v_~__unbuffered_p2_EAX~0_99) (= v_P2Thread1of1ForFork1_~arg.offset_31 |v_P2Thread1of1ForFork1_#in~arg.offset_31|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_31, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_31, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~z~0=v_~z~0_386, ~y~0=v_~y~0_61, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~x~0] and [332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_110 256) 0))))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_45 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_58))) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite .cse0 0 v_~z$w_buff0_used~0_110) v_~z$w_buff0_used~0_109) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_24))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_110, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-06 06:38:12,903 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:12,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 541 [2022-12-06 06:38:12,904 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 738 flow [2022-12-06 06:38:12,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:38:12,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:12,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:12,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:38:12,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -322591655, now seen corresponding path program 1 times [2022-12-06 06:38:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:12,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20192224] [2022-12-06 06:38:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:13,506 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:38:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:13,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20192224] [2022-12-06 06:38:13,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20192224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:13,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:13,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969578357] [2022-12-06 06:38:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:13,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:13,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 06:38:13,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:13,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:13,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 06:38:13,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:13,845 INFO L130 PetriNetUnfolder]: 780/1330 cut-off events. [2022-12-06 06:38:13,845 INFO L131 PetriNetUnfolder]: For 9173/9173 co-relation queries the response was YES. [2022-12-06 06:38:13,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6597 conditions, 1330 events. 780/1330 cut-off events. For 9173/9173 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6645 event pairs, 292 based on Foata normal form. 6/1335 useless extension candidates. Maximal degree in co-relation 6567. Up to 1144 conditions per place. [2022-12-06 06:38:13,864 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 13 changer transitions 6/80 dead transitions. [2022-12-06 06:38:13,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 1030 flow [2022-12-06 06:38:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 06:38:13,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2022-12-06 06:38:13,865 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 738 flow. Second operand 4 states and 59 transitions. [2022-12-06 06:38:13,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 1030 flow [2022-12-06 06:38:13,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 972 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:13,885 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 736 flow [2022-12-06 06:38:13,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=736, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-06 06:38:13,886 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2022-12-06 06:38:13,886 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:13,886 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 736 flow [2022-12-06 06:38:13,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:13,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:13,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 736 flow [2022-12-06 06:38:13,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 736 flow [2022-12-06 06:38:13,926 INFO L130 PetriNetUnfolder]: 93/266 cut-off events. [2022-12-06 06:38:13,927 INFO L131 PetriNetUnfolder]: For 1653/1770 co-relation queries the response was YES. [2022-12-06 06:38:13,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 266 events. 93/266 cut-off events. For 1653/1770 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1459 event pairs, 11 based on Foata normal form. 7/265 useless extension candidates. Maximal degree in co-relation 1395. Up to 159 conditions per place. [2022-12-06 06:38:13,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 736 flow [2022-12-06 06:38:13,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 06:38:13,934 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:13,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 06:38:13,936 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 736 flow [2022-12-06 06:38:13,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:13,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:13,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:13,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:38:13,937 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash -322599343, now seen corresponding path program 1 times [2022-12-06 06:38:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:13,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506683292] [2022-12-06 06:38:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:14,762 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:38:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506683292] [2022-12-06 06:38:14,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506683292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:14,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:14,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581660751] [2022-12-06 06:38:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:14,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:14,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:14,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 06:38:14,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:14,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:14,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 06:38:14,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:15,227 INFO L130 PetriNetUnfolder]: 779/1340 cut-off events. [2022-12-06 06:38:15,228 INFO L131 PetriNetUnfolder]: For 8899/8899 co-relation queries the response was YES. [2022-12-06 06:38:15,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 1340 events. 779/1340 cut-off events. For 8899/8899 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6714 event pairs, 176 based on Foata normal form. 2/1342 useless extension candidates. Maximal degree in co-relation 6530. Up to 1007 conditions per place. [2022-12-06 06:38:15,243 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 66 selfloop transitions, 31 changer transitions 6/104 dead transitions. [2022-12-06 06:38:15,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 1225 flow [2022-12-06 06:38:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:38:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:38:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 06:38:15,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2022-12-06 06:38:15,245 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 736 flow. Second operand 7 states and 79 transitions. [2022-12-06 06:38:15,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 1225 flow [2022-12-06 06:38:15,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 1192 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:15,264 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 987 flow [2022-12-06 06:38:15,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=987, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2022-12-06 06:38:15,265 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2022-12-06 06:38:15,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:15,265 INFO L89 Accepts]: Start accepts. Operand has 71 places, 76 transitions, 987 flow [2022-12-06 06:38:15,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:15,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:15,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 76 transitions, 987 flow [2022-12-06 06:38:15,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 76 transitions, 987 flow [2022-12-06 06:38:15,316 INFO L130 PetriNetUnfolder]: 96/280 cut-off events. [2022-12-06 06:38:15,316 INFO L131 PetriNetUnfolder]: For 2426/2579 co-relation queries the response was YES. [2022-12-06 06:38:15,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 280 events. 96/280 cut-off events. For 2426/2579 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1589 event pairs, 7 based on Foata normal form. 4/275 useless extension candidates. Maximal degree in co-relation 1649. Up to 171 conditions per place. [2022-12-06 06:38:15,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 76 transitions, 987 flow [2022-12-06 06:38:15,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 06:38:15,325 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:15,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 06:38:15,326 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 987 flow [2022-12-06 06:38:15,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:15,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:15,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:15,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:38:15,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1408533322, now seen corresponding path program 1 times [2022-12-06 06:38:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:15,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224765379] [2022-12-06 06:38:15,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:15,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:15,943 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:38:15,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:15,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224765379] [2022-12-06 06:38:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224765379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:38:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562906952] [2022-12-06 06:38:15,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:15,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:38:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:38:15,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:38:15,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:38:15,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 987 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:15,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:15,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:38:15,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:16,350 INFO L130 PetriNetUnfolder]: 774/1328 cut-off events. [2022-12-06 06:38:16,351 INFO L131 PetriNetUnfolder]: For 11731/11731 co-relation queries the response was YES. [2022-12-06 06:38:16,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7051 conditions, 1328 events. 774/1328 cut-off events. For 11731/11731 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6743 event pairs, 222 based on Foata normal form. 8/1336 useless extension candidates. Maximal degree in co-relation 7017. Up to 952 conditions per place. [2022-12-06 06:38:16,362 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 58 selfloop transitions, 24 changer transitions 15/100 dead transitions. [2022-12-06 06:38:16,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 1340 flow [2022-12-06 06:38:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:38:16,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2022-12-06 06:38:16,365 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 987 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:38:16,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 1340 flow [2022-12-06 06:38:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 1308 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:16,384 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 978 flow [2022-12-06 06:38:16,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=978, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2022-12-06 06:38:16,385 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2022-12-06 06:38:16,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:16,385 INFO L89 Accepts]: Start accepts. Operand has 74 places, 71 transitions, 978 flow [2022-12-06 06:38:16,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:16,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:16,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 71 transitions, 978 flow [2022-12-06 06:38:16,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 978 flow [2022-12-06 06:38:16,419 INFO L130 PetriNetUnfolder]: 80/227 cut-off events. [2022-12-06 06:38:16,419 INFO L131 PetriNetUnfolder]: For 2224/2365 co-relation queries the response was YES. [2022-12-06 06:38:16,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 227 events. 80/227 cut-off events. For 2224/2365 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1181 event pairs, 7 based on Foata normal form. 5/227 useless extension candidates. Maximal degree in co-relation 1395. Up to 139 conditions per place. [2022-12-06 06:38:16,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 71 transitions, 978 flow [2022-12-06 06:38:16,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 06:38:16,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [457] $Ultimate##0-->L794: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= v_~z~0_375 1) (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_95) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~y~0=v_~y~0_57} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_375, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:16,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [457] $Ultimate##0-->L794: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= v_~z~0_375 1) (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_95) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~y~0=v_~y~0_57} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_375, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:16,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:16,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 06:38:16,483 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 980 flow [2022-12-06 06:38:16,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:16,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:16,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:16,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:38:16,484 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1412469361, now seen corresponding path program 1 times [2022-12-06 06:38:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:16,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217870429] [2022-12-06 06:38:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:17,231 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:38:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:17,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217870429] [2022-12-06 06:38:17,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217870429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:17,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:17,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:38:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067132230] [2022-12-06 06:38:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:17,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:38:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:38:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:38:17,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:38:17,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 980 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:17,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:17,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:38:17,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:17,521 INFO L130 PetriNetUnfolder]: 564/968 cut-off events. [2022-12-06 06:38:17,521 INFO L131 PetriNetUnfolder]: For 8977/8978 co-relation queries the response was YES. [2022-12-06 06:38:17,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 968 events. 564/968 cut-off events. For 8977/8978 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4545 event pairs, 147 based on Foata normal form. 8/976 useless extension candidates. Maximal degree in co-relation 5338. Up to 587 conditions per place. [2022-12-06 06:38:17,534 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 48 selfloop transitions, 13 changer transitions 26/90 dead transitions. [2022-12-06 06:38:17,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 1265 flow [2022-12-06 06:38:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 06:38:17,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 06:38:17,536 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 980 flow. Second operand 5 states and 64 transitions. [2022-12-06 06:38:17,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 1265 flow [2022-12-06 06:38:17,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 1213 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:38:17,557 INFO L231 Difference]: Finished difference. Result has 76 places, 49 transitions, 613 flow [2022-12-06 06:38:17,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=613, PETRI_PLACES=76, PETRI_TRANSITIONS=49} [2022-12-06 06:38:17,558 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2022-12-06 06:38:17,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:17,558 INFO L89 Accepts]: Start accepts. Operand has 76 places, 49 transitions, 613 flow [2022-12-06 06:38:17,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:17,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:17,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 49 transitions, 613 flow [2022-12-06 06:38:17,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 49 transitions, 613 flow [2022-12-06 06:38:17,581 INFO L130 PetriNetUnfolder]: 54/141 cut-off events. [2022-12-06 06:38:17,582 INFO L131 PetriNetUnfolder]: For 1126/1165 co-relation queries the response was YES. [2022-12-06 06:38:17,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 141 events. 54/141 cut-off events. For 1126/1165 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 599 event pairs, 4 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 843. Up to 89 conditions per place. [2022-12-06 06:38:17,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 49 transitions, 613 flow [2022-12-06 06:38:17,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 06:38:18,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:18,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-06 06:38:18,149 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 635 flow [2022-12-06 06:38:18,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:18,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:18,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:18,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:38:18,149 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1193508207, now seen corresponding path program 1 times [2022-12-06 06:38:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:18,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514883829] [2022-12-06 06:38:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:18,273 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:38:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:18,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514883829] [2022-12-06 06:38:18,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514883829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:18,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:18,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29066558] [2022-12-06 06:38:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:18,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:18,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:38:18,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:38:18,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:18,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:38:18,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:18,383 INFO L130 PetriNetUnfolder]: 215/393 cut-off events. [2022-12-06 06:38:18,383 INFO L131 PetriNetUnfolder]: For 6148/6159 co-relation queries the response was YES. [2022-12-06 06:38:18,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 393 events. 215/393 cut-off events. For 6148/6159 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1451 event pairs, 55 based on Foata normal form. 23/413 useless extension candidates. Maximal degree in co-relation 2359. Up to 298 conditions per place. [2022-12-06 06:38:18,387 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 57 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2022-12-06 06:38:18,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 842 flow [2022-12-06 06:38:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:38:18,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 06:38:18,389 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 635 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:38:18,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 842 flow [2022-12-06 06:38:18,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 705 flow, removed 35 selfloop flow, removed 17 redundant places. [2022-12-06 06:38:18,423 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 429 flow [2022-12-06 06:38:18,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 06:38:18,424 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2022-12-06 06:38:18,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:18,424 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 429 flow [2022-12-06 06:38:18,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:18,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:18,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 429 flow [2022-12-06 06:38:18,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 429 flow [2022-12-06 06:38:18,451 INFO L130 PetriNetUnfolder]: 68/174 cut-off events. [2022-12-06 06:38:18,451 INFO L131 PetriNetUnfolder]: For 1257/1327 co-relation queries the response was YES. [2022-12-06 06:38:18,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 174 events. 68/174 cut-off events. For 1257/1327 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 768 event pairs, 19 based on Foata normal form. 1/165 useless extension candidates. Maximal degree in co-relation 774. Up to 76 conditions per place. [2022-12-06 06:38:18,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 429 flow [2022-12-06 06:38:18,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 06:38:18,959 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:38:18,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 536 [2022-12-06 06:38:18,960 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 435 flow [2022-12-06 06:38:18,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:38:18,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:18,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:18,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:38:18,961 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash -660560143, now seen corresponding path program 1 times [2022-12-06 06:38:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:18,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080095536] [2022-12-06 06:38:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:19,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:19,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080095536] [2022-12-06 06:38:19,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080095536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:19,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:19,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017048949] [2022-12-06 06:38:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:19,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:19,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:19,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:38:19,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:38:19,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:19,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:38:19,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:19,167 INFO L130 PetriNetUnfolder]: 115/225 cut-off events. [2022-12-06 06:38:19,168 INFO L131 PetriNetUnfolder]: For 1506/1511 co-relation queries the response was YES. [2022-12-06 06:38:19,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 225 events. 115/225 cut-off events. For 1506/1511 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 738 event pairs, 21 based on Foata normal form. 27/245 useless extension candidates. Maximal degree in co-relation 1216. Up to 88 conditions per place. [2022-12-06 06:38:19,170 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 60 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-06 06:38:19,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 759 flow [2022-12-06 06:38:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 06:38:19,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 06:38:19,172 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 435 flow. Second operand 4 states and 53 transitions. [2022-12-06 06:38:19,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 759 flow [2022-12-06 06:38:19,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 714 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 06:38:19,176 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 388 flow [2022-12-06 06:38:19,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-06 06:38:19,176 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-06 06:38:19,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:19,176 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 388 flow [2022-12-06 06:38:19,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:19,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:19,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 388 flow [2022-12-06 06:38:19,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 388 flow [2022-12-06 06:38:19,190 INFO L130 PetriNetUnfolder]: 26/85 cut-off events. [2022-12-06 06:38:19,190 INFO L131 PetriNetUnfolder]: For 428/449 co-relation queries the response was YES. [2022-12-06 06:38:19,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 85 events. 26/85 cut-off events. For 428/449 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 268 event pairs, 4 based on Foata normal form. 6/88 useless extension candidates. Maximal degree in co-relation 389. Up to 37 conditions per place. [2022-12-06 06:38:19,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 388 flow [2022-12-06 06:38:19,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 06:38:19,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:19,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:38:19,196 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 388 flow [2022-12-06 06:38:19,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:38:19,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:19,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:19,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:38:19,196 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1506115905, now seen corresponding path program 1 times [2022-12-06 06:38:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:19,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544399960] [2022-12-06 06:38:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:19,341 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:38:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:19,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544399960] [2022-12-06 06:38:19,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544399960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:19,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:19,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:19,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704718335] [2022-12-06 06:38:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:19,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:19,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:38:19,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 388 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:38:19,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:19,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:38:19,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:19,425 INFO L130 PetriNetUnfolder]: 101/196 cut-off events. [2022-12-06 06:38:19,425 INFO L131 PetriNetUnfolder]: For 1141/1144 co-relation queries the response was YES. [2022-12-06 06:38:19,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 196 events. 101/196 cut-off events. For 1141/1144 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 632 event pairs, 19 based on Foata normal form. 9/203 useless extension candidates. Maximal degree in co-relation 1030. Up to 80 conditions per place. [2022-12-06 06:38:19,429 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 57 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2022-12-06 06:38:19,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 742 flow [2022-12-06 06:38:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 06:38:19,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2022-12-06 06:38:19,430 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 388 flow. Second operand 5 states and 53 transitions. [2022-12-06 06:38:19,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 742 flow [2022-12-06 06:38:19,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 659 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-06 06:38:19,434 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 360 flow [2022-12-06 06:38:19,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-06 06:38:19,435 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-06 06:38:19,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:19,435 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 360 flow [2022-12-06 06:38:19,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:19,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:19,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 360 flow [2022-12-06 06:38:19,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 360 flow [2022-12-06 06:38:19,446 INFO L130 PetriNetUnfolder]: 20/66 cut-off events. [2022-12-06 06:38:19,446 INFO L131 PetriNetUnfolder]: For 198/208 co-relation queries the response was YES. [2022-12-06 06:38:19,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 66 events. 20/66 cut-off events. For 198/208 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 1 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 266. Up to 23 conditions per place. [2022-12-06 06:38:19,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 360 flow [2022-12-06 06:38:19,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 06:45:25,478 WARN L233 SmtUtils]: Spent 17.64s on a formula simplification that was a NOOP. DAG size: 2541 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 06:50:53,990 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:50:53,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 754556 [2022-12-06 06:50:53,991 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 356 flow [2022-12-06 06:50:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:50:53,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:50:53,992 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:50:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:50:53,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:50:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:50:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1215792950, now seen corresponding path program 1 times [2022-12-06 06:50:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:50:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675160646] [2022-12-06 06:50:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:50:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:50:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:50:54,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:50:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:50:54,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:50:54,075 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:50:54,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:50:54,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:50:54,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:50:54,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:50:54,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:50:54,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:50:54,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:50:54,078 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:50:54,083 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:50:54,083 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:50:54,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:50:54 BasicIcfg [2022-12-06 06:50:54,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:50:54,135 INFO L158 Benchmark]: Toolchain (without parser) took 779838.84ms. Allocated memory was 207.6MB in the beginning and 857.7MB in the end (delta: 650.1MB). Free memory was 164.0MB in the beginning and 733.0MB in the end (delta: -569.0MB). Peak memory consumption was 81.6MB. Max. memory is 8.0GB. [2022-12-06 06:50:54,135 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:50:54,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.27ms. Allocated memory is still 207.6MB. Free memory was 163.4MB in the beginning and 137.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:50:54,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.13ms. Allocated memory is still 207.6MB. Free memory was 137.2MB in the beginning and 134.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:50:54,136 INFO L158 Benchmark]: Boogie Preprocessor took 25.44ms. Allocated memory is still 207.6MB. Free memory was 134.6MB in the beginning and 133.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:50:54,136 INFO L158 Benchmark]: RCFGBuilder took 706.68ms. Allocated memory is still 207.6MB. Free memory was 133.0MB in the beginning and 96.9MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-06 06:50:54,136 INFO L158 Benchmark]: TraceAbstraction took 778465.15ms. Allocated memory was 207.6MB in the beginning and 857.7MB in the end (delta: 650.1MB). Free memory was 96.3MB in the beginning and 733.0MB in the end (delta: -636.7MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-12-06 06:50:54,137 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 207.6MB. Free memory is still 183.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 553.27ms. Allocated memory is still 207.6MB. Free memory was 163.4MB in the beginning and 137.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.13ms. Allocated memory is still 207.6MB. Free memory was 137.2MB in the beginning and 134.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.44ms. Allocated memory is still 207.6MB. Free memory was 134.6MB in the beginning and 133.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 706.68ms. Allocated memory is still 207.6MB. Free memory was 133.0MB in the beginning and 96.9MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 778465.15ms. Allocated memory was 207.6MB in the beginning and 857.7MB in the end (delta: 650.1MB). Free memory was 96.3MB in the beginning and 733.0MB in the end (delta: -636.7MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 112 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 1465, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1165, independent: 1130, independent conditional: 0, independent unconditional: 1130, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1165, independent: 1112, independent conditional: 0, independent unconditional: 1112, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1521, independent: 335, independent conditional: 0, independent unconditional: 335, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1165, unknown conditional: 0, unknown unconditional: 1165] , Statistics on independence cache: Total cache size (in pairs): 1758, Positive cache size: 1723, Positive conditional cache size: 0, Positive unconditional cache size: 1723, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 65, independent conditional: 65, 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: 87, independent: 65, independent conditional: 13, independent unconditional: 52, 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: 87, independent: 65, independent conditional: 13, independent unconditional: 52, 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: 87, independent: 65, independent conditional: 13, independent unconditional: 52, 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: 78, independent: 61, independent conditional: 12, independent unconditional: 49, 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: 78, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 82, dependent conditional: 11, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 78, unknown conditional: 14, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 61, Positive conditional cache size: 12, Positive unconditional cache size: 49, 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.4s, 34 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 154, 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: 178, independent: 154, independent conditional: 8, independent unconditional: 146, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 154, independent conditional: 4, independent unconditional: 150, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 4, independent unconditional: 150, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, independent: 136, independent conditional: 4, independent unconditional: 132, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 22, unknown conditional: 1, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 91, Positive conditional cache size: 12, Positive unconditional cache size: 79, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 129, independent conditional: 16, independent unconditional: 113, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 93, Positive conditional cache size: 12, Positive unconditional cache size: 81, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, independent: 165, independent conditional: 165, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 199, independent: 165, independent conditional: 35, independent unconditional: 130, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 199, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 100, Positive conditional cache size: 12, Positive unconditional cache size: 88, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 26, independent conditional: 9, independent unconditional: 17, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 102, Positive conditional cache size: 12, Positive unconditional cache size: 90, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 81, independent conditional: 57, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 81, independent conditional: 13, independent unconditional: 68, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 81, independent conditional: 13, independent unconditional: 68, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 87, independent: 71, independent conditional: 11, independent unconditional: 60, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 127, Positive conditional cache size: 14, Positive unconditional cache size: 113, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 74, independent conditional: 56, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 74, independent conditional: 12, independent unconditional: 62, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 74, independent conditional: 12, independent unconditional: 62, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 82, independent: 73, independent conditional: 12, independent unconditional: 61, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 136, Positive conditional cache size: 14, Positive unconditional cache size: 122, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 140, Positive conditional cache size: 16, Positive unconditional cache size: 124, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 120, independent conditional: 120, 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: 132, independent: 120, independent conditional: 86, independent unconditional: 34, 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: 132, independent: 120, independent conditional: 50, independent unconditional: 70, 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: 132, independent: 120, independent conditional: 50, independent unconditional: 70, 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: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 109, independent conditional: 45, independent unconditional: 64, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 167, Positive conditional cache size: 21, Positive unconditional cache size: 146, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 198, independent conditional: 198, 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: 222, independent: 198, independent conditional: 106, independent unconditional: 92, 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: 222, independent: 198, independent conditional: 55, independent unconditional: 143, 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: 222, independent: 198, independent conditional: 55, independent unconditional: 143, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 196, independent conditional: 54, independent unconditional: 142, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 175, Positive conditional cache size: 22, Positive unconditional cache size: 153, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 58 PlacesBefore, 58 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 194, independent conditional: 194, 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: 222, independent: 194, independent conditional: 86, independent unconditional: 108, 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: 222, independent: 194, independent conditional: 46, independent unconditional: 148, 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: 222, independent: 194, independent conditional: 46, independent unconditional: 148, 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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 222, independent: 191, independent conditional: 45, independent unconditional: 146, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 200, Positive conditional cache size: 23, Positive unconditional cache size: 177, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 63 PlacesBefore, 62 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 184, independent conditional: 184, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 216, independent: 184, independent conditional: 80, independent unconditional: 104, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 184, independent conditional: 49, independent unconditional: 135, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 184, independent conditional: 49, independent unconditional: 135, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, independent: 182, independent conditional: 48, independent unconditional: 134, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 204, Positive conditional cache size: 24, Positive unconditional cache size: 180, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 105, independent conditional: 34, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 105, independent conditional: 20, independent unconditional: 85, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 105, independent conditional: 20, independent unconditional: 85, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 124, independent: 105, independent conditional: 20, independent unconditional: 85, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 204, Positive conditional cache size: 24, Positive unconditional cache size: 180, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 419, independent: 388, independent conditional: 388, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 419, independent: 388, independent conditional: 237, independent unconditional: 151, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 419, independent: 388, independent conditional: 160, independent unconditional: 228, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 419, independent: 388, independent conditional: 160, independent unconditional: 228, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 419, independent: 386, independent conditional: 158, independent unconditional: 228, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 206, Positive conditional cache size: 26, Positive unconditional cache size: 180, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 74 PlacesBefore, 74 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 756, independent: 696, independent conditional: 696, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 756, independent: 696, independent conditional: 394, independent unconditional: 302, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 756, independent: 696, independent conditional: 342, independent unconditional: 354, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 756, independent: 696, independent conditional: 342, independent unconditional: 354, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 756, independent: 692, independent conditional: 339, independent unconditional: 353, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 214, Positive conditional cache size: 29, Positive unconditional cache size: 185, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 69 PlacesBefore, 69 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 261, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 261, independent: 227, independent conditional: 99, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 261, independent: 227, independent conditional: 42, independent unconditional: 185, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 261, independent: 227, independent conditional: 42, independent unconditional: 185, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 261, independent: 224, independent conditional: 42, independent unconditional: 182, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 220, Positive conditional cache size: 29, Positive unconditional cache size: 191, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 24, independent unconditional: 18, 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: 42, independent: 42, independent conditional: 18, independent unconditional: 24, 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: 42, independent: 42, independent conditional: 18, independent unconditional: 24, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 42, independent: 39, independent conditional: 18, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 251, Positive conditional cache size: 29, Positive unconditional cache size: 222, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 251, Positive conditional cache size: 29, Positive unconditional cache size: 222, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 754.5s, 54 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 41 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 4, independent unconditional: 4, 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: 8, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 258, Positive conditional cache size: 29, Positive unconditional cache size: 229, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 [L790] 2 __unbuffered_p2_EAX = y [L793] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: 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, 134 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: 778.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558 IncrementalHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 23 mSDtfsCounter, 1558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=987occurred in iteration=14, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 2568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:50:54,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...