/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:14:47,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:14:47,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:14:47,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:14:47,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:14:47,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:14:47,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:14:47,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:14:47,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:14:47,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:14:47,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:14:47,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:14:47,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:14:47,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:14:47,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:14:47,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:14:47,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:14:47,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:14:47,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:14:47,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:14:47,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:14:47,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:14:47,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:14:47,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:14:47,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:14:47,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:14:47,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:14:47,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:14:47,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:14:47,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:14:47,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:14:47,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:14:47,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:14:47,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:14:47,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:14:47,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:14:47,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:14:47,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:14:47,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:14:47,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:14:47,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:14:47,523 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-RepeatedSemanticLbe.epf [2022-12-13 06:14:47,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:14:47,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:14:47,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:14:47,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:14:47,561 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:14:47,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:14:47,562 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:14:47,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:14:47,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:14:47,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:14:47,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:14:47,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:14:47,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:14:47,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:14:47,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:14:47,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:14:47,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:14:47,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:14:47,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:14:47,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:14:47,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:14:47,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:14:47,566 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:14:47,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:14:47,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:14:47,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:14:47,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:14:47,902 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:14:47,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 06:14:49,016 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:14:49,253 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:14:49,254 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 06:14:49,267 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d872d43/72fff6cac3274fdcaaedc6f52e502c3a/FLAG868b6fb4f [2022-12-13 06:14:49,283 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d872d43/72fff6cac3274fdcaaedc6f52e502c3a [2022-12-13 06:14:49,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:14:49,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:14:49,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:14:49,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:14:49,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:14:49,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d5ceab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49, skipping insertion in model container [2022-12-13 06:14:49,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:14:49,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:14:49,548 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 06:14:49,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:14:49,809 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:14:49,821 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 06:14:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:14:49,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:14:49,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:14:49,909 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:14:49,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49 WrapperNode [2022-12-13 06:14:49,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:14:49,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:14:49,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:14:49,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:14:49,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,978 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 06:14:49,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:14:49,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:14:49,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:14:49,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:14:49,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:49,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:50,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:50,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:50,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:50,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:50,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:14:50,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:14:50,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:14:50,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:14:50,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (1/1) ... [2022-12-13 06:14:50,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:14:50,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:14:50,064 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-13 06:14:50,088 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-13 06:14:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:14:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:14:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:14:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:14:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:14:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:14:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:14:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:14:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:14:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:14:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:14:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:14:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:14:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:14:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:14:50,106 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:14:50,272 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:14:50,274 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:14:50,593 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:14:50,719 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:14:50,719 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:14:50,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:50 BoogieIcfgContainer [2022-12-13 06:14:50,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:14:50,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:14:50,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:14:50,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:14:50,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:14:49" (1/3) ... [2022-12-13 06:14:50,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cf8045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:14:50, skipping insertion in model container [2022-12-13 06:14:50,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:49" (2/3) ... [2022-12-13 06:14:50,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cf8045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:14:50, skipping insertion in model container [2022-12-13 06:14:50,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:50" (3/3) ... [2022-12-13 06:14:50,729 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 06:14:50,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:14:50,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:14:50,747 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:14:50,810 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:14:50,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 06:14:50,907 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 06:14:50,907 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:14:50,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 06:14:50,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 06:14:50,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-13 06:14:50,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:14:50,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 06:14:50,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-13 06:14:51,021 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 06:14:51,022 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:14:51,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 06:14:51,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 06:14:51,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 06:14:57,468 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 06:14:57,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:14:57,500 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;@5f940244, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:14:57,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 06:14:57,503 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 06:14:57,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:14:57,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:14:57,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 06:14:57,506 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-13 06:14:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:14:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash 515099, now seen corresponding path program 1 times [2022-12-13 06:14:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:14:57,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922276546] [2022-12-13 06:14:57,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:14:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:14:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:14:58,053 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-13 06:14:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:14:58,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922276546] [2022-12-13 06:14:58,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922276546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:14:58,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:14:58,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:14:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516178963] [2022-12-13 06:14:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:14:58,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:14:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:14:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:14:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:14:58,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 69 [2022-12-13 06:14:58,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 06:14:58,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:14:58,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 69 [2022-12-13 06:14:58,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:00,879 INFO L130 PetriNetUnfolder]: 10840/17378 cut-off events. [2022-12-13 06:15:00,880 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 06:15:00,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 17378 events. 10840/17378 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 136902 event pairs, 1440 based on Foata normal form. 0/10486 useless extension candidates. Maximal degree in co-relation 32830. Up to 13045 conditions per place. [2022-12-13 06:15:00,975 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 38 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-13 06:15:00,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 433 flow [2022-12-13 06:15:01,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:15:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:15:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-12-13 06:15:01,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-13 06:15:01,026 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2022-12-13 06:15:01,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 111 transitions, 433 flow [2022-12-13 06:15:01,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 52 transitions, 199 flow [2022-12-13 06:15:01,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:01,180 INFO L89 Accepts]: Start accepts. Operand has 47 places, 52 transitions, 199 flow [2022-12-13 06:15:01,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:01,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:01,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 52 transitions, 199 flow [2022-12-13 06:15:01,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 52 transitions, 199 flow [2022-12-13 06:15:01,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 06:15:01,734 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:01,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 559 [2022-12-13 06:15:01,737 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 52 transitions, 199 flow [2022-12-13 06:15:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 06:15:01,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:01,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:15:01,741 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-13 06:15:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash 5120902, now seen corresponding path program 1 times [2022-12-13 06:15:01,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:01,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841169527] [2022-12-13 06:15:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:02,244 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-13 06:15:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841169527] [2022-12-13 06:15:02,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841169527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:02,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:02,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:15:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952424735] [2022-12-13 06:15:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:02,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:15:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:15:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:15:02,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 06:15:02,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:15:02,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:02,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 06:15:02,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:03,392 INFO L130 PetriNetUnfolder]: 5349/8268 cut-off events. [2022-12-13 06:15:03,392 INFO L131 PetriNetUnfolder]: For 1108/1108 co-relation queries the response was YES. [2022-12-13 06:15:03,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22579 conditions, 8268 events. 5349/8268 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 50630 event pairs, 1047 based on Foata normal form. 198/6986 useless extension candidates. Maximal degree in co-relation 22565. Up to 5884 conditions per place. [2022-12-13 06:15:03,461 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 64 selfloop transitions, 7 changer transitions 2/81 dead transitions. [2022-12-13 06:15:03,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 459 flow [2022-12-13 06:15:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:15:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:15:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 06:15:03,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2022-12-13 06:15:03,478 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-13 06:15:03,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 81 transitions, 459 flow [2022-12-13 06:15:03,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 79 transitions, 451 flow [2022-12-13 06:15:03,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:03,593 INFO L89 Accepts]: Start accepts. Operand has 48 places, 79 transitions, 451 flow [2022-12-13 06:15:03,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:03,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:03,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 79 transitions, 451 flow [2022-12-13 06:15:03,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 79 transitions, 451 flow [2022-12-13 06:15:03,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 06:15:03,602 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:03,603 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 06:15:03,605 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 79 transitions, 451 flow [2022-12-13 06:15:03,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:15:03,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:03,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:03,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:15:03,605 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-13 06:15:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 158748357, now seen corresponding path program 1 times [2022-12-13 06:15:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816707739] [2022-12-13 06:15:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:03,777 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-13 06:15:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:03,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816707739] [2022-12-13 06:15:03,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816707739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:03,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:03,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:15:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279236418] [2022-12-13 06:15:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:15:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:03,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:15:03,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:15:03,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 06:15:03,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 79 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 06:15:03,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:03,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 06:15:03,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:04,856 INFO L130 PetriNetUnfolder]: 3848/6044 cut-off events. [2022-12-13 06:15:04,860 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-13 06:15:04,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22542 conditions, 6044 events. 3848/6044 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 35404 event pairs, 148 based on Foata normal form. 90/5053 useless extension candidates. Maximal degree in co-relation 22525. Up to 4614 conditions per place. [2022-12-13 06:15:04,935 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 86 selfloop transitions, 7 changer transitions 4/105 dead transitions. [2022-12-13 06:15:04,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 105 transitions, 795 flow [2022-12-13 06:15:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:15:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:15:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 06:15:04,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 06:15:04,963 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-13 06:15:04,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 105 transitions, 795 flow [2022-12-13 06:15:04,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 101 transitions, 763 flow [2022-12-13 06:15:05,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:05,042 INFO L89 Accepts]: Start accepts. Operand has 50 places, 101 transitions, 763 flow [2022-12-13 06:15:05,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:05,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:05,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 101 transitions, 763 flow [2022-12-13 06:15:05,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 101 transitions, 763 flow [2022-12-13 06:15:05,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 686 [2022-12-13 06:15:05,052 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:05,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 06:15:05,054 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 101 transitions, 763 flow [2022-12-13 06:15:05,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 06:15:05,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:05,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:05,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:15:05,054 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-13 06:15:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:05,055 INFO L85 PathProgramCache]: Analyzing trace with hash 630124774, now seen corresponding path program 1 times [2022-12-13 06:15:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:05,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979586330] [2022-12-13 06:15:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:05,291 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-13 06:15:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979586330] [2022-12-13 06:15:05,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979586330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:05,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:05,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:15:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854767175] [2022-12-13 06:15:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:05,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:15:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:15:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:15:05,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 06:15:05,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 101 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 06:15:05,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:05,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 06:15:05,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:06,389 INFO L130 PetriNetUnfolder]: 3404/5361 cut-off events. [2022-12-13 06:15:06,407 INFO L131 PetriNetUnfolder]: For 631/631 co-relation queries the response was YES. [2022-12-13 06:15:06,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25022 conditions, 5361 events. 3404/5361 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 30609 event pairs, 138 based on Foata normal form. 10/4532 useless extension candidates. Maximal degree in co-relation 25002. Up to 4081 conditions per place. [2022-12-13 06:15:06,467 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 102 selfloop transitions, 15 changer transitions 0/125 dead transitions. [2022-12-13 06:15:06,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:15:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:15:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 06:15:06,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2022-12-13 06:15:06,471 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-13 06:15:06,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:06,578 INFO L89 Accepts]: Start accepts. Operand has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:06,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:06,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 770 [2022-12-13 06:15:06,589 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:06,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 06:15:06,599 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 125 transitions, 1191 flow [2022-12-13 06:15:06,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 06:15:06,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:06,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:06,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:15:06,600 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-13 06:15:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1940869511, now seen corresponding path program 1 times [2022-12-13 06:15:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:06,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208169484] [2022-12-13 06:15:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:06,815 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-13 06:15:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208169484] [2022-12-13 06:15:06,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208169484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:06,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:06,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:15:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427395790] [2022-12-13 06:15:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:06,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:15:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:15:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:15:06,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 06:15:06,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 125 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-13 06:15:06,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:06,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 06:15:06,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:07,889 INFO L130 PetriNetUnfolder]: 4214/6516 cut-off events. [2022-12-13 06:15:07,889 INFO L131 PetriNetUnfolder]: For 7687/7783 co-relation queries the response was YES. [2022-12-13 06:15:07,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34782 conditions, 6516 events. 4214/6516 cut-off events. For 7687/7783 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 37338 event pairs, 567 based on Foata normal form. 148/5770 useless extension candidates. Maximal degree in co-relation 34759. Up to 5650 conditions per place. [2022-12-13 06:15:07,948 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 132 selfloop transitions, 34 changer transitions 0/182 dead transitions. [2022-12-13 06:15:07,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:15:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:15:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 06:15:07,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 06:15:07,952 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-13 06:15:07,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:08,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:08,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:08,113 INFO L89 Accepts]: Start accepts. Operand has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:08,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:08,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:08,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:08,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:08,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 06:15:08,130 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:08,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 06:15:08,131 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 182 transitions, 2081 flow [2022-12-13 06:15:08,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-13 06:15:08,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:08,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:15:08,132 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-13 06:15:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash 610324497, now seen corresponding path program 1 times [2022-12-13 06:15:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143782447] [2022-12-13 06:15:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:08,376 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-13 06:15:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:08,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143782447] [2022-12-13 06:15:08,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143782447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:08,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:08,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:15:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732724749] [2022-12-13 06:15:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:08,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:15:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:15:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:15:08,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 06:15:08,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 182 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-13 06:15:08,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:08,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 06:15:08,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:09,661 INFO L130 PetriNetUnfolder]: 5553/8621 cut-off events. [2022-12-13 06:15:09,661 INFO L131 PetriNetUnfolder]: For 16445/16632 co-relation queries the response was YES. [2022-12-13 06:15:09,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52740 conditions, 8621 events. 5553/8621 cut-off events. For 16445/16632 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 52282 event pairs, 750 based on Foata normal form. 267/7627 useless extension candidates. Maximal degree in co-relation 52714. Up to 7571 conditions per place. [2022-12-13 06:15:09,718 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 162 selfloop transitions, 9 changer transitions 36/224 dead transitions. [2022-12-13 06:15:09,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 224 transitions, 3003 flow [2022-12-13 06:15:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:15:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:15:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 06:15:09,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 06:15:09,722 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2022-12-13 06:15:09,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 224 transitions, 3003 flow [2022-12-13 06:15:09,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 188 transitions, 2503 flow [2022-12-13 06:15:09,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:09,863 INFO L89 Accepts]: Start accepts. Operand has 57 places, 188 transitions, 2503 flow [2022-12-13 06:15:09,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:09,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:09,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 188 transitions, 2503 flow [2022-12-13 06:15:09,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 188 transitions, 2503 flow [2022-12-13 06:15:09,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 06:15:09,880 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:09,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 06:15:09,887 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 188 transitions, 2503 flow [2022-12-13 06:15:09,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-13 06:15:09,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:09,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:09,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:15:09,888 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-13 06:15:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1997211001, now seen corresponding path program 1 times [2022-12-13 06:15:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972607550] [2022-12-13 06:15:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:15:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:10,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972607550] [2022-12-13 06:15:10,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972607550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:10,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:10,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:15:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16725978] [2022-12-13 06:15:10,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:10,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:15:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:15:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:15:10,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 06:15:10,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 188 transitions, 2503 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-13 06:15:10,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:10,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 06:15:10,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:11,925 INFO L130 PetriNetUnfolder]: 7568/11920 cut-off events. [2022-12-13 06:15:11,925 INFO L131 PetriNetUnfolder]: For 25833/26016 co-relation queries the response was YES. [2022-12-13 06:15:11,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82377 conditions, 11920 events. 7568/11920 cut-off events. For 25833/26016 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 79817 event pairs, 1545 based on Foata normal form. 243/10250 useless extension candidates. Maximal degree in co-relation 82348. Up to 10896 conditions per place. [2022-12-13 06:15:12,038 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 215 selfloop transitions, 10 changer transitions 78/320 dead transitions. [2022-12-13 06:15:12,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 320 transitions, 4951 flow [2022-12-13 06:15:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:15:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:15:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 06:15:12,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 06:15:12,041 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-13 06:15:12,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 320 transitions, 4951 flow [2022-12-13 06:15:12,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 242 transitions, 3709 flow [2022-12-13 06:15:12,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:12,297 INFO L89 Accepts]: Start accepts. Operand has 60 places, 242 transitions, 3709 flow [2022-12-13 06:15:12,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:12,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:12,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 242 transitions, 3709 flow [2022-12-13 06:15:12,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 242 transitions, 3709 flow [2022-12-13 06:15:12,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 834 [2022-12-13 06:15:12,336 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:12,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 06:15:12,337 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 242 transitions, 3709 flow [2022-12-13 06:15:12,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-13 06:15:12,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:12,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:12,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:15:12,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:15:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1272036889, now seen corresponding path program 2 times [2022-12-13 06:15:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043294235] [2022-12-13 06:15:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:12,710 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-13 06:15:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:12,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043294235] [2022-12-13 06:15:12,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043294235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:12,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:12,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:15:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263155421] [2022-12-13 06:15:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:12,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:15:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:15:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:15:12,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 06:15:12,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 242 transitions, 3709 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-13 06:15:12,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:12,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 06:15:12,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:13,574 INFO L130 PetriNetUnfolder]: 2293/4584 cut-off events. [2022-12-13 06:15:13,576 INFO L131 PetriNetUnfolder]: For 14568/14893 co-relation queries the response was YES. [2022-12-13 06:15:13,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35692 conditions, 4584 events. 2293/4584 cut-off events. For 14568/14893 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35407 event pairs, 204 based on Foata normal form. 426/4293 useless extension candidates. Maximal degree in co-relation 35660. Up to 4023 conditions per place. [2022-12-13 06:15:13,623 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 71 changer transitions 67/288 dead transitions. [2022-12-13 06:15:13,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 288 transitions, 4960 flow [2022-12-13 06:15:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:15:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:15:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 06:15:13,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 06:15:13,643 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -15 predicate places. [2022-12-13 06:15:13,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 288 transitions, 4960 flow [2022-12-13 06:15:13,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 221 transitions, 3762 flow [2022-12-13 06:15:13,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:13,703 INFO L89 Accepts]: Start accepts. Operand has 63 places, 221 transitions, 3762 flow [2022-12-13 06:15:13,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:13,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:13,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 221 transitions, 3762 flow [2022-12-13 06:15:13,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 221 transitions, 3762 flow [2022-12-13 06:15:13,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 06:15:13,714 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:15:13,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 06:15:13,717 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 221 transitions, 3762 flow [2022-12-13 06:15:13,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-13 06:15:13,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:13,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:13,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:15:13,718 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-13 06:15:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash 424852268, now seen corresponding path program 1 times [2022-12-13 06:15:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:13,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914130124] [2022-12-13 06:15:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:14,216 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-13 06:15:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914130124] [2022-12-13 06:15:14,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914130124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:14,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:15:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314422291] [2022-12-13 06:15:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:14,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:15:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:15:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:15:14,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 06:15:14,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 221 transitions, 3762 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-13 06:15:14,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:14,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 06:15:14,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:14,839 INFO L130 PetriNetUnfolder]: 951/2075 cut-off events. [2022-12-13 06:15:14,839 INFO L131 PetriNetUnfolder]: For 10181/10398 co-relation queries the response was YES. [2022-12-13 06:15:14,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17801 conditions, 2075 events. 951/2075 cut-off events. For 10181/10398 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14311 event pairs, 3 based on Foata normal form. 338/2096 useless extension candidates. Maximal degree in co-relation 17766. Up to 1664 conditions per place. [2022-12-13 06:15:14,868 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 53 selfloop transitions, 46 changer transitions 108/214 dead transitions. [2022-12-13 06:15:14,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 214 transitions, 4038 flow [2022-12-13 06:15:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:15:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:15:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 06:15:14,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2022-12-13 06:15:14,870 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-13 06:15:14,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 214 transitions, 4038 flow [2022-12-13 06:15:14,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 106 transitions, 1944 flow [2022-12-13 06:15:14,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:14,923 INFO L89 Accepts]: Start accepts. Operand has 64 places, 106 transitions, 1944 flow [2022-12-13 06:15:14,941 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:14,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:14,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 106 transitions, 1944 flow [2022-12-13 06:15:14,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 106 transitions, 1944 flow [2022-12-13 06:15:14,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 06:15:15,558 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 06:15:15,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 637 [2022-12-13 06:15:15,559 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 104 transitions, 1904 flow [2022-12-13 06:15:15,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-13 06:15:15,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:15,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:15,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:15:15,560 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-13 06:15:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1323531751, now seen corresponding path program 1 times [2022-12-13 06:15:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:15,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706570200] [2022-12-13 06:15:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:15:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:15:16,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:15:16,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706570200] [2022-12-13 06:15:16,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706570200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:15:16,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:15:16,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:15:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946396197] [2022-12-13 06:15:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:15:16,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:15:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:15:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:15:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:15:16,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2022-12-13 06:15:16,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 104 transitions, 1904 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-13 06:15:16,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:15:16,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2022-12-13 06:15:16,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:15:16,906 INFO L130 PetriNetUnfolder]: 601/1086 cut-off events. [2022-12-13 06:15:16,906 INFO L131 PetriNetUnfolder]: For 5300/5313 co-relation queries the response was YES. [2022-12-13 06:15:16,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10287 conditions, 1086 events. 601/1086 cut-off events. For 5300/5313 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5225 event pairs, 0 based on Foata normal form. 34/900 useless extension candidates. Maximal degree in co-relation 10249. Up to 937 conditions per place. [2022-12-13 06:15:16,920 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 64 selfloop transitions, 6 changer transitions 75/159 dead transitions. [2022-12-13 06:15:16,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 159 transitions, 3302 flow [2022-12-13 06:15:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:15:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:15:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 06:15:16,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2022-12-13 06:15:16,923 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-13 06:15:16,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 159 transitions, 3302 flow [2022-12-13 06:15:16,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 84 transitions, 1671 flow [2022-12-13 06:15:16,961 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:15:16,962 INFO L89 Accepts]: Start accepts. Operand has 64 places, 84 transitions, 1671 flow [2022-12-13 06:15:16,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:15:16,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:15:16,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 84 transitions, 1671 flow [2022-12-13 06:15:16,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 84 transitions, 1671 flow [2022-12-13 06:15:16,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 06:15:16,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:15:16,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 06:15:16,997 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 84 transitions, 1671 flow [2022-12-13 06:15:16,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-13 06:15:16,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:15:16,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:16,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:15:16,998 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-13 06:15:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:15:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2140563735, now seen corresponding path program 2 times [2022-12-13 06:15:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:15:16,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804129210] [2022-12-13 06:15:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:15:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:15:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:15:17,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:15:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:15:17,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:15:17,133 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:15:17,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 06:15:17,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 06:15:17,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 06:15:17,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 06:15:17,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 06:15:17,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 06:15:17,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:15:17,136 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:15:17,143 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:15:17,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:15:17,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:15:17 BasicIcfg [2022-12-13 06:15:17,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:15:17,246 INFO L158 Benchmark]: Toolchain (without parser) took 27960.01ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 145.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 605.5MB. Max. memory is 8.0GB. [2022-12-13 06:15:17,246 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:15:17,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.08ms. Allocated memory is still 182.5MB. Free memory was 145.1MB in the beginning and 117.7MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 06:15:17,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.51ms. Allocated memory is still 182.5MB. Free memory was 117.7MB in the beginning and 115.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:15:17,262 INFO L158 Benchmark]: Boogie Preprocessor took 35.32ms. Allocated memory is still 182.5MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:15:17,263 INFO L158 Benchmark]: RCFGBuilder took 706.56ms. Allocated memory is still 182.5MB. Free memory was 113.5MB in the beginning and 78.3MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 06:15:17,263 INFO L158 Benchmark]: TraceAbstraction took 26521.35ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 77.3MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 537.3MB. Max. memory is 8.0GB. [2022-12-13 06:15:17,264 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 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 613.08ms. Allocated memory is still 182.5MB. Free memory was 145.1MB in the beginning and 117.7MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.51ms. Allocated memory is still 182.5MB. Free memory was 117.7MB in the beginning and 115.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.32ms. Allocated memory is still 182.5MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 706.56ms. Allocated memory is still 182.5MB. Free memory was 113.5MB in the beginning and 78.3MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 26521.35ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 77.3MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 537.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 117 PlacesBefore, 78 PlacesAfterwards, 109 TransitionsBefore, 69 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 4320, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2217, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2217, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 285, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4453, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 2217, unknown conditional: 0, unknown unconditional: 2217] , Statistics on independence cache: Total cache size (in pairs): 4387, Positive cache size: 4345, Positive conditional cache size: 0, Positive unconditional cache size: 4345, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 47 PlacesBefore, 47 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 125, independent conditional: 125, 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: 133, independent: 125, independent conditional: 33, independent unconditional: 92, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 125, independent conditional: 13, independent unconditional: 112, 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: 133, independent: 125, independent conditional: 13, independent unconditional: 112, 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: 69, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 61, independent conditional: 5, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 69, unknown conditional: 8, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 600 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 686 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 770 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 756 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 714 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 834 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 756 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): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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.6s, 64 PlacesBefore, 62 PlacesAfterwards, 106 TransitionsBefore, 104 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 141 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: 26.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 13 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3762occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 06:15:17,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...