/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:22:37,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:22:37,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:22:37,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:22:37,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:22:37,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:22:37,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:22:37,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:22:37,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:22:37,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:22:37,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:22:37,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:22:37,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:22:37,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:22:37,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:22:37,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:22:37,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:22:37,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:22:37,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:22:37,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:22:37,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:22:37,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:22:37,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:22:37,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:22:37,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:22:37,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:22:37,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:22:37,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:22:37,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:22:37,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:22:37,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:22:37,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:22:37,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:22:37,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:22:37,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:22:37,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:22:37,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:22:37,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:22:37,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:22:37,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:22:37,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:22:37,870 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:22:37,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:22:37,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:22:37,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:22:37,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:22:37,903 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:22:37,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:22:37,904 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:22:37,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:22:37,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:22:37,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:22:37,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:22:37,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:22:37,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:22:37,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:22:37,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:22:37,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:22:37,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:22:37,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:22:37,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:22:37,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:22:37,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:22:37,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:22:37,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:22:38,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:22:38,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:22:38,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:22:38,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:22:38,229 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:22:38,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i [2022-12-06 04:22:39,204 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:22:39,568 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:22:39,568 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i [2022-12-06 04:22:39,597 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f6f54d82/f58975b893554cd1ad46272eb0986c0b/FLAG15832e503 [2022-12-06 04:22:39,619 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f6f54d82/f58975b893554cd1ad46272eb0986c0b [2022-12-06 04:22:39,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:22:39,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:22:39,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:22:39,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:22:39,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:22:39,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:22:39" (1/1) ... [2022-12-06 04:22:39,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4cd343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:39, skipping insertion in model container [2022-12-06 04:22:39,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:22:39" (1/1) ... [2022-12-06 04:22:39,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:22:39,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:22:39,855 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/rfi006_power.opt.i[993,1006] [2022-12-06 04:22:40,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:22:40,112 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:22:40,132 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/rfi006_power.opt.i[993,1006] [2022-12-06 04:22:40,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:40,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:40,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:22:40,251 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:22:40,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40 WrapperNode [2022-12-06 04:22:40,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:22:40,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:22:40,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:22:40,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:22:40,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,312 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-12-06 04:22:40,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:22:40,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:22:40,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:22:40,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:22:40,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,371 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:22:40,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:22:40,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:22:40,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:22:40,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (1/1) ... [2022-12-06 04:22:40,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:22:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:22:40,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:22:40,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:22:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:22:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:22:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:22:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:22:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:22:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:22:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:22:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:22:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:22:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:22:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:22:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:22:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:22:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:22:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:22:40,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:22:40,457 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:22:40,645 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:22:40,647 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:22:41,089 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:22:41,476 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:22:41,477 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:22:41,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:22:41 BoogieIcfgContainer [2022-12-06 04:22:41,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:22:41,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:22:41,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:22:41,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:22:41,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:22:39" (1/3) ... [2022-12-06 04:22:41,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597d5025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:22:41, skipping insertion in model container [2022-12-06 04:22:41,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:40" (2/3) ... [2022-12-06 04:22:41,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597d5025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:22:41, skipping insertion in model container [2022-12-06 04:22:41,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:22:41" (3/3) ... [2022-12-06 04:22:41,489 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2022-12-06 04:22:41,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:22:41,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:22:41,506 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:22:41,584 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:22:41,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:22:41,666 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:22:41,667 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:41,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:22:41,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:22:41,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-06 04:22:41,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:41,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:22:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-06 04:22:41,730 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:22:41,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:41,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:22:41,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:22:41,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-06 04:23:03,381 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 709 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 04:24:06,283 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 04:24:06,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:24:06,310 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;@4a4bf7cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:24:06,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:24:06,322 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:24:06,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:06,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:06,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:06,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash 169046281, now seen corresponding path program 1 times [2022-12-06 04:24:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:06,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060452159] [2022-12-06 04:24:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:06,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060452159] [2022-12-06 04:24:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060452159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:06,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:06,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776333809] [2022-12-06 04:24:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:06,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:06,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:24:06,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:06,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:06,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:24:06,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:07,208 INFO L130 PetriNetUnfolder]: 615/939 cut-off events. [2022-12-06 04:24:07,209 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 04:24:07,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 939 events. 615/939 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4183 event pairs, 129 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 1899. Up to 703 conditions per place. [2022-12-06 04:24:07,219 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 23 selfloop transitions, 2 changer transitions 4/31 dead transitions. [2022-12-06 04:24:07,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 129 flow [2022-12-06 04:24:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:24:07,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:24:07,233 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:24:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 129 flow [2022-12-06 04:24:07,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:24:07,238 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 48 flow [2022-12-06 04:24:07,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-06 04:24:07,243 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 04:24:07,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:07,244 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 48 flow [2022-12-06 04:24:07,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:07,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:07,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 48 flow [2022-12-06 04:24:07,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 48 flow [2022-12-06 04:24:07,254 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:24:07,255 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:07,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:24:07,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 48 flow [2022-12-06 04:24:07,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 04:24:07,465 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:07,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 04:24:07,471 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 04:24:07,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:07,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:07,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:07,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:24:07,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -755227209, now seen corresponding path program 1 times [2022-12-06 04:24:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:07,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237868336] [2022-12-06 04:24:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237868336] [2022-12-06 04:24:07,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237868336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:07,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:07,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:07,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796039885] [2022-12-06 04:24:07,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:07,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:07,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:24:07,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:07,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:07,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:24:07,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:07,904 INFO L130 PetriNetUnfolder]: 463/718 cut-off events. [2022-12-06 04:24:07,904 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:24:07,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 718 events. 463/718 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3000 event pairs, 157 based on Foata normal form. 24/741 useless extension candidates. Maximal degree in co-relation 1520. Up to 493 conditions per place. [2022-12-06 04:24:07,910 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:24:07,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 124 flow [2022-12-06 04:24:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:24:07,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-06 04:24:07,912 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:24:07,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 124 flow [2022-12-06 04:24:07,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:07,913 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:24:07,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:24:07,914 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2022-12-06 04:24:07,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:07,915 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:24:07,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:07,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:07,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:24:07,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:24:07,921 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:24:07,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:07,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:24:07,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:24:07,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:24:07,938 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:07,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:24:07,940 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 04:24:07,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:07,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:07,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:07,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:24:07,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1174913258, now seen corresponding path program 1 times [2022-12-06 04:24:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740313533] [2022-12-06 04:24:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740313533] [2022-12-06 04:24:08,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740313533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:08,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:08,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283800286] [2022-12-06 04:24:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:08,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:08,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:24:08,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:08,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:08,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:24:08,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:08,438 INFO L130 PetriNetUnfolder]: 349/607 cut-off events. [2022-12-06 04:24:08,438 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 04:24:08,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 607 events. 349/607 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2816 event pairs, 75 based on Foata normal form. 12/618 useless extension candidates. Maximal degree in co-relation 1207. Up to 427 conditions per place. [2022-12-06 04:24:08,443 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 04:24:08,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 138 flow [2022-12-06 04:24:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:24:08,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 04:24:08,445 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:24:08,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 138 flow [2022-12-06 04:24:08,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:08,446 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2022-12-06 04:24:08,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-06 04:24:08,447 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 04:24:08,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:08,447 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 56 flow [2022-12-06 04:24:08,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:08,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:08,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-06 04:24:08,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 56 flow [2022-12-06 04:24:08,454 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:24:08,454 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:24:08,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:24:08,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-06 04:24:08,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:24:08,456 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:08,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:24:08,457 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2022-12-06 04:24:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:08,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:08,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:08,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:24:08,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2062644732, now seen corresponding path program 1 times [2022-12-06 04:24:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:08,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509377601] [2022-12-06 04:24:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:09,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509377601] [2022-12-06 04:24:09,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509377601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:09,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:09,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31070278] [2022-12-06 04:24:09,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:09,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:09,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:09,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:24:09,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:09,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:09,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:24:09,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:10,269 INFO L130 PetriNetUnfolder]: 462/744 cut-off events. [2022-12-06 04:24:10,270 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 04:24:10,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 744 events. 462/744 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3275 event pairs, 44 based on Foata normal form. 12/755 useless extension candidates. Maximal degree in co-relation 1686. Up to 429 conditions per place. [2022-12-06 04:24:10,276 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 34 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2022-12-06 04:24:10,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 205 flow [2022-12-06 04:24:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 04:24:10,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 04:24:10,278 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 5 states and 55 transitions. [2022-12-06 04:24:10,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 205 flow [2022-12-06 04:24:10,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:10,280 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 114 flow [2022-12-06 04:24:10,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 04:24:10,281 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2022-12-06 04:24:10,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:10,281 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 114 flow [2022-12-06 04:24:10,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:10,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:10,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 114 flow [2022-12-06 04:24:10,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 114 flow [2022-12-06 04:24:10,305 INFO L130 PetriNetUnfolder]: 29/97 cut-off events. [2022-12-06 04:24:10,305 INFO L131 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2022-12-06 04:24:10,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 97 events. 29/97 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 383 event pairs, 15 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 211. Up to 51 conditions per place. [2022-12-06 04:24:10,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 114 flow [2022-12-06 04:24:10,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 04:24:10,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] $Ultimate##0-->L833: Formula: (and (= v_~x$r_buff1_thd2~0_97 v_~x$r_buff0_thd2~0_105) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|) (= v_~x$w_buff0_used~0_335 1) (= v_~x$r_buff0_thd3~0_79 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_302 256) 0)) (not (= (mod v_~x$w_buff0_used~0_335 256) 0)))) 1 0)) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$r_buff1_thd0~0_76 v_~x$r_buff0_thd0~0_75) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_80) (= v_~x$w_buff0~0_234 v_~x$w_buff1~0_203) (= v_~x$w_buff0~0_233 1) (= v_~x$w_buff0_used~0_336 v_~x$w_buff1_used~0_302) (= v_~x$r_buff0_thd1~0_106 v_~x$r_buff1_thd1~0_102) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_234, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_336} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_233, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_203, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_97, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_302, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_102, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_335, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork0_~arg#1.base, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1] and [725] L4-->L873: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_53 256) 0))) (let ((.cse8 (= (mod v_~x$r_buff1_thd0~0_53 256) 0)) (.cse1 (not .cse10)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_272 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_243 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_273 256) 0))) (let ((.cse2 (not .cse9)) (.cse4 (not .cse7)) (.cse0 (select |v_#memory_int_280| |v_~#x~0.base_184|)) (.cse3 (and .cse1 .cse11)) (.cse5 (not .cse8))) (and (= (store |v_#memory_int_280| |v_~#x~0.base_184| (store .cse0 |v_~#x~0.offset_184| |v_ULTIMATE.start_main_#t~ite38#1_43|)) |v_#memory_int_279|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= v_~x$w_buff0_used~0_272 (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_273)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_243) v_~x$w_buff1_used~0_242) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem36#1_53| |v_ULTIMATE.start_main_#t~mem36#1_51|))) (or (and (= |v_ULTIMATE.start_main_#t~ite38#1_43| v_~x$w_buff0~0_185) (= |v_ULTIMATE.start_main_#t~ite37#1_46| |v_ULTIMATE.start_main_#t~ite37#1_44|) .cse1 .cse2 .cse6) (and (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_44| v_~x$w_buff1~0_160) .cse4 .cse5 .cse6) (and (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~ite37#1_44| |v_ULTIMATE.start_main_#t~mem36#1_51|) (= |v_ULTIMATE.start_main_#t~mem36#1_51| (select .cse0 |v_~#x~0.offset_184|)))) (= |v_ULTIMATE.start_main_#t~ite37#1_44| |v_ULTIMATE.start_main_#t~ite38#1_43|) (or .cse9 .cse10)))) (= v_~x$r_buff0_thd0~0_52 (ite .cse3 0 v_~x$r_buff0_thd0~0_53)) (= v_~x$r_buff1_thd0~0_52 (ite (or (and .cse11 (not (= (mod v_~x$r_buff0_thd0~0_52 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_242 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_53)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~#x~0.offset=|v_~#x~0.offset_184|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~x$w_buff1~0=v_~x$w_buff1~0_160, #memory_int=|v_#memory_int_280|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_243, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_46|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_53, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_242, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, #memory_int=|v_#memory_int_279|, ~#x~0.base=|v_~#x~0.base_184|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_42|} AuxVars[|v_ULTIMATE.start_main_#t~ite38#1_43|, |v_ULTIMATE.start_main_#t~ite37#1_44|, |v_ULTIMATE.start_main_#t~mem36#1_51|] AssignedVars[~x$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0] [2022-12-06 04:24:11,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] $Ultimate##0-->L833: Formula: (and (= v_~x$r_buff1_thd2~0_97 v_~x$r_buff0_thd2~0_105) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|) (= v_~x$w_buff0_used~0_335 1) (= v_~x$r_buff0_thd3~0_79 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_302 256) 0)) (not (= (mod v_~x$w_buff0_used~0_335 256) 0)))) 1 0)) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$r_buff1_thd0~0_76 v_~x$r_buff0_thd0~0_75) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_80) (= v_~x$w_buff0~0_234 v_~x$w_buff1~0_203) (= v_~x$w_buff0~0_233 1) (= v_~x$w_buff0_used~0_336 v_~x$w_buff1_used~0_302) (= v_~x$r_buff0_thd1~0_106 v_~x$r_buff1_thd1~0_102) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_234, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_336} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_233, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_203, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_97, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_302, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_102, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_335, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork0_~arg#1.base, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1] and [655] L796-->L812: Formula: (let ((.cse9 (= 0 (mod v_~x$w_buff1_used~0_187 256))) (.cse6 (= (mod v_~x$r_buff1_thd2~0_63 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd2~0_68 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_205 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice2~0_90 256) 0)) (.cse8 (not .cse16)) (.cse7 (not .cse13)) (.cse1 (and .cse6 .cse13)) (.cse2 (and .cse9 .cse13)) (.cse14 (select |v_#memory_int_216| |v_~#x~0.base_146|))) (let ((.cse4 (select .cse14 |v_~#x~0.offset_146|)) (.cse5 (or .cse16 .cse1 .cse2)) (.cse10 (and .cse8 .cse7)) (.cse12 (= (mod v_~x$w_buff1_used~0_186 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_204 256) 0)) (.cse0 (not .cse15))) (and (= v_~x$w_buff1_used~0_186 (ite .cse0 v_~x$w_buff1_used~0_187 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_187 0))) (or (and (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem22_36|) (= |v_P1_#t~mem22_36| .cse4) .cse5) (and (or (not .cse6) .cse7) .cse8 (or (not .cse9) .cse7) (= v_~__unbuffered_p1_EBX~0_20 (ite .cse10 v_~x$w_buff0~0_122 v_~x$w_buff1~0_117)) (= |v_P1Thread1of1ForFork2_#t~mem22_1| |v_P1_#t~mem22_36|))) (= v_~x$flush_delayed~0_64 0) (= |v_P1Thread1of1ForFork2_#t~nondet20_1| v_~weak$$choice2~0_90) (= v_~x$w_buff0~0_122 v_~x$w_buff0~0_121) (= v_~x$r_buff1_thd2~0_62 (ite .cse0 v_~x$r_buff1_thd2~0_63 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd2~0_67 256) 0))) (or (and .cse11 .cse6) .cse3 (and .cse11 .cse12))) v_~x$r_buff1_thd2~0_63 0))) (= |v_P1Thread1of1ForFork2_#t~nondet19_1| v_~weak$$choice0~0_52) (= v_~x$mem_tmp~0_40 .cse4) (= (ite .cse0 v_~x$w_buff0_used~0_205 (ite .cse5 v_~x$w_buff0_used~0_205 (ite .cse10 0 v_~x$w_buff0_used~0_205))) v_~x$w_buff0_used~0_204) (= v_~x$w_buff1~0_117 v_~x$w_buff1~0_116) (= v_~x$r_buff0_thd2~0_67 (ite .cse0 v_~x$r_buff0_thd2~0_68 (ite (or .cse1 (and .cse12 .cse13) .cse3) v_~x$r_buff0_thd2~0_68 (ite (and (not .cse3) .cse7) 0 v_~x$r_buff0_thd2~0_68)))) (= (store |v_#memory_int_216| |v_~#x~0.base_146| (store .cse14 |v_~#x~0.offset_146| |v_P1_#t~ite26_37|)) |v_#memory_int_215|) (or (and .cse15 (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem25_38|) (= |v_P1_#t~ite26_37| |v_P1_#t~mem25_38|)) (and .cse0 (= |v_P1Thread1of1ForFork2_#t~mem25_1| |v_P1_#t~mem25_38|) (= |v_P1_#t~ite26_37| v_~x$mem_tmp~0_40))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, ~#x~0.offset=|v_~#x~0.offset_146|, P1Thread1of1ForFork2_#t~mem22=|v_P1Thread1of1ForFork2_#t~mem22_1|, ~x$w_buff1~0=v_~x$w_buff1~0_117, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, P1Thread1of1ForFork2_#t~nondet19=|v_P1Thread1of1ForFork2_#t~nondet19_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_205, #memory_int=|v_#memory_int_216|, ~#x~0.base=|v_~#x~0.base_146|, P1Thread1of1ForFork2_#t~mem25=|v_P1Thread1of1ForFork2_#t~mem25_1|, P1Thread1of1ForFork2_#t~nondet20=|v_P1Thread1of1ForFork2_#t~nondet20_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, P1Thread1of1ForFork2_#t~mem24=|v_P1Thread1of1ForFork2_#t~mem24_1|, ~x$flush_delayed~0=v_~x$flush_delayed~0_64, ~#x~0.offset=|v_~#x~0.offset_146|, ~x$w_buff1~0=v_~x$w_buff1~0_116, P1Thread1of1ForFork2_#t~mem21=|v_P1Thread1of1ForFork2_#t~mem21_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_186, P1Thread1of1ForFork2_#t~ite23=|v_P1Thread1of1ForFork2_#t~ite23_1|, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, P1Thread1of1ForFork2_#t~ite26=|v_P1Thread1of1ForFork2_#t~ite26_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204, ~weak$$choice0~0=v_~weak$$choice0~0_52, #memory_int=|v_#memory_int_215|, ~#x~0.base=|v_~#x~0.base_146|, ~weak$$choice2~0=v_~weak$$choice2~0_90} AuxVars[|v_P1_#t~ite26_37|, |v_P1_#t~mem25_38|, |v_P1_#t~mem22_36|] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork2_#t~mem24, ~x$flush_delayed~0, P1Thread1of1ForFork2_#t~mem22, ~x$w_buff1~0, P1Thread1of1ForFork2_#t~mem21, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~nondet19, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite26, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P1Thread1of1ForFork2_#t~mem25, ~weak$$choice2~0, P1Thread1of1ForFork2_#t~nondet20] [2022-12-06 04:24:12,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:12,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1791 [2022-12-06 04:24:12,072 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 118 flow [2022-12-06 04:24:12,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:12,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:12,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:12,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:24:12,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 410586026, now seen corresponding path program 2 times [2022-12-06 04:24:12,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087720558] [2022-12-06 04:24:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:12,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087720558] [2022-12-06 04:24:12,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087720558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:12,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:12,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:24:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712718038] [2022-12-06 04:24:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:12,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:24:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:24:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:24:12,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:24:12,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 118 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:12,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:12,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:24:12,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:13,326 INFO L130 PetriNetUnfolder]: 463/754 cut-off events. [2022-12-06 04:24:13,326 INFO L131 PetriNetUnfolder]: For 492/495 co-relation queries the response was YES. [2022-12-06 04:24:13,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 754 events. 463/754 cut-off events. For 492/495 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3561 event pairs, 42 based on Foata normal form. 14/766 useless extension candidates. Maximal degree in co-relation 2163. Up to 421 conditions per place. [2022-12-06 04:24:13,332 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 36 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2022-12-06 04:24:13,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 275 flow [2022-12-06 04:24:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 04:24:13,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2022-12-06 04:24:13,338 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 118 flow. Second operand 5 states and 56 transitions. [2022-12-06 04:24:13,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 275 flow [2022-12-06 04:24:13,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:24:13,342 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 160 flow [2022-12-06 04:24:13,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2022-12-06 04:24:13,344 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-12-06 04:24:13,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:13,344 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 160 flow [2022-12-06 04:24:13,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:13,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:13,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 160 flow [2022-12-06 04:24:13,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 160 flow [2022-12-06 04:24:13,379 INFO L130 PetriNetUnfolder]: 30/95 cut-off events. [2022-12-06 04:24:13,379 INFO L131 PetriNetUnfolder]: For 155/177 co-relation queries the response was YES. [2022-12-06 04:24:13,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 95 events. 30/95 cut-off events. For 155/177 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 379 event pairs, 11 based on Foata normal form. 4/98 useless extension candidates. Maximal degree in co-relation 282. Up to 51 conditions per place. [2022-12-06 04:24:13,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 160 flow [2022-12-06 04:24:13,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 04:24:13,385 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:13,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 04:24:13,388 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 160 flow [2022-12-06 04:24:13,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:13,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:13,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:13,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:24:13,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash 262305668, now seen corresponding path program 1 times [2022-12-06 04:24:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:13,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079100431] [2022-12-06 04:24:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:13,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079100431] [2022-12-06 04:24:13,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079100431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:13,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:13,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421168555] [2022-12-06 04:24:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:13,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:24:13,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:13,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:13,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:24:13,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:13,888 INFO L130 PetriNetUnfolder]: 404/685 cut-off events. [2022-12-06 04:24:13,889 INFO L131 PetriNetUnfolder]: For 1298/1299 co-relation queries the response was YES. [2022-12-06 04:24:13,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 685 events. 404/685 cut-off events. For 1298/1299 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3191 event pairs, 59 based on Foata normal form. 72/752 useless extension candidates. Maximal degree in co-relation 2265. Up to 421 conditions per place. [2022-12-06 04:24:13,894 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 41 selfloop transitions, 4 changer transitions 29/76 dead transitions. [2022-12-06 04:24:13,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 583 flow [2022-12-06 04:24:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 04:24:13,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2022-12-06 04:24:13,898 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 160 flow. Second operand 5 states and 69 transitions. [2022-12-06 04:24:13,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 583 flow [2022-12-06 04:24:13,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:24:13,904 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 194 flow [2022-12-06 04:24:13,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-06 04:24:13,907 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-12-06 04:24:13,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:13,907 INFO L89 Accepts]: Start accepts. Operand has 45 places, 31 transitions, 194 flow [2022-12-06 04:24:13,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:13,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:13,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 194 flow [2022-12-06 04:24:13,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 194 flow [2022-12-06 04:24:13,947 INFO L130 PetriNetUnfolder]: 110/222 cut-off events. [2022-12-06 04:24:13,947 INFO L131 PetriNetUnfolder]: For 443/466 co-relation queries the response was YES. [2022-12-06 04:24:13,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 222 events. 110/222 cut-off events. For 443/466 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 940 event pairs, 36 based on Foata normal form. 5/208 useless extension candidates. Maximal degree in co-relation 747. Up to 111 conditions per place. [2022-12-06 04:24:13,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 194 flow [2022-12-06 04:24:13,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 04:24:13,953 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:13,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 04:24:13,953 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 194 flow [2022-12-06 04:24:13,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:13,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:13,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:13,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:24:13,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash -321012798, now seen corresponding path program 1 times [2022-12-06 04:24:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:13,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889689805] [2022-12-06 04:24:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889689805] [2022-12-06 04:24:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889689805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:14,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:14,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909008424] [2022-12-06 04:24:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:14,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:24:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:24:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:24:14,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:24:14,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:14,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:14,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:24:14,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:14,426 INFO L130 PetriNetUnfolder]: 222/413 cut-off events. [2022-12-06 04:24:14,426 INFO L131 PetriNetUnfolder]: For 1020/1021 co-relation queries the response was YES. [2022-12-06 04:24:14,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 413 events. 222/413 cut-off events. For 1020/1021 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1777 event pairs, 29 based on Foata normal form. 45/453 useless extension candidates. Maximal degree in co-relation 1595. Up to 154 conditions per place. [2022-12-06 04:24:14,430 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 51 selfloop transitions, 7 changer transitions 25/85 dead transitions. [2022-12-06 04:24:14,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 682 flow [2022-12-06 04:24:14,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:24:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:24:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 04:24:14,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-06 04:24:14,432 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 194 flow. Second operand 6 states and 81 transitions. [2022-12-06 04:24:14,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 682 flow [2022-12-06 04:24:14,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 85 transitions, 674 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:14,437 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 246 flow [2022-12-06 04:24:14,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2022-12-06 04:24:14,438 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-06 04:24:14,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:14,438 INFO L89 Accepts]: Start accepts. Operand has 49 places, 34 transitions, 246 flow [2022-12-06 04:24:14,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:14,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:14,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 34 transitions, 246 flow [2022-12-06 04:24:14,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 246 flow [2022-12-06 04:24:14,463 INFO L130 PetriNetUnfolder]: 42/120 cut-off events. [2022-12-06 04:24:14,463 INFO L131 PetriNetUnfolder]: For 348/378 co-relation queries the response was YES. [2022-12-06 04:24:14,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 120 events. 42/120 cut-off events. For 348/378 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 450 event pairs, 7 based on Foata normal form. 11/127 useless extension candidates. Maximal degree in co-relation 475. Up to 57 conditions per place. [2022-12-06 04:24:14,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 246 flow [2022-12-06 04:24:14,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 04:24:14,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] L862-3-->L4: Formula: (and (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= v_~main$tmp_guard0~0_46 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_85) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [787] $Ultimate##0-->L873: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_115 256) 0))) (let ((.cse1 (not .cse3)) (.cse5 (not (= 0 (mod v_~x$w_buff0_used~0_430 256))))) (let ((.cse2 (select |v_#memory_int_491| |v_~#x~0.base_241|)) (.cse4 (= (mod v_~x$w_buff0_used~0_432 256) 0)) (.cse0 (and .cse1 .cse5))) (and (= v_~x$w_buff0~0_303 1) (= v_~x$r_buff0_thd0~0_114 (ite .cse0 0 v_~x$r_buff0_thd0~0_115)) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_16| |v_P2Thread1of1ForFork0_~arg#1.base_16|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~x$w_buff0~0_304 v_~x$w_buff1~0_267) (= v_~x$r_buff0_thd2~0_150 v_~x$r_buff1_thd2~0_143) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_108| |v_ULTIMATE.start_main_#t~ite37#1_106|) .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_95| v_~x$w_buff0~0_303) (= |v_ULTIMATE.start_main_#t~mem36#1_115| |v_ULTIMATE.start_main_#t~mem36#1_113|)) (and (= |v_ULTIMATE.start_main_#t~mem36#1_113| (select .cse2 |v_~#x~0.offset_241|)) (= |v_ULTIMATE.start_main_#t~ite37#1_106| |v_ULTIMATE.start_main_#t~ite38#1_95|) (= |v_ULTIMATE.start_main_#t~ite37#1_106| |v_ULTIMATE.start_main_#t~mem36#1_113|) .cse3)) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24| (ite .cse4 1 0)) (= v_~x$r_buff0_thd1~0_142 v_~x$r_buff1_thd1~0_139) (= v_~x$r_buff0_thd3~0_139 1) (= v_~x$r_buff1_thd0~0_115 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_390 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_114 256) 0)) .cse5)) 0 v_~x$r_buff0_thd0~0_115)) (= (store |v_#memory_int_491| |v_~#x~0.base_241| (store .cse2 |v_~#x~0.offset_241| |v_ULTIMATE.start_main_#t~ite38#1_95|)) |v_#memory_int_490|) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_430) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_24|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_16| |v_P2Thread1of1ForFork0_#in~arg#1.offset_16|) (= v_~x$r_buff0_thd3~0_140 v_~x$r_buff1_thd3~0_109) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| 0)) (= (ite (or (and (not .cse4) .cse1) .cse0) 0 v_~x$w_buff0_used~0_432) v_~x$w_buff1_used~0_390))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_304, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_142, ~#x~0.offset=|v_~#x~0.offset_241|, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_16|, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_108|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_140, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_115|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_432, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_16|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_491|, ~#x~0.base=|v_~#x~0.base_241|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_303, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_142, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_139, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_139, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_16|, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_16|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_114, ~#x~0.offset=|v_~#x~0.offset_241|, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_16|, ~x$w_buff1~0=v_~x$w_buff1~0_267, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_390, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_430, #memory_int=|v_#memory_int_490|, ~#x~0.base=|v_~#x~0.base_241|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_94|, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_24|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_113|, |v_ULTIMATE.start_main_#t~ite38#1_95|, |v_ULTIMATE.start_main_#t~ite37#1_106|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, P2Thread1of1ForFork0_~arg#1.base, #memory_int, ULTIMATE.start_main_#t~ite38#1, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1] [2022-12-06 04:24:14,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:14,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-06 04:24:14,823 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 250 flow [2022-12-06 04:24:14,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:14,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:14,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:14,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:24:14,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1404140088, now seen corresponding path program 1 times [2022-12-06 04:24:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:14,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942433179] [2022-12-06 04:24:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:15,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942433179] [2022-12-06 04:24:15,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942433179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:15,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:15,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:24:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966450521] [2022-12-06 04:24:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:15,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:15,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:24:15,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:15,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:15,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:24:15,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:15,203 INFO L130 PetriNetUnfolder]: 147/284 cut-off events. [2022-12-06 04:24:15,203 INFO L131 PetriNetUnfolder]: For 822/823 co-relation queries the response was YES. [2022-12-06 04:24:15,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 284 events. 147/284 cut-off events. For 822/823 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1150 event pairs, 26 based on Foata normal form. 12/291 useless extension candidates. Maximal degree in co-relation 1156. Up to 120 conditions per place. [2022-12-06 04:24:15,207 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 47 selfloop transitions, 10 changer transitions 11/70 dead transitions. [2022-12-06 04:24:15,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 592 flow [2022-12-06 04:24:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:24:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:24:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-06 04:24:15,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2022-12-06 04:24:15,213 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 250 flow. Second operand 7 states and 71 transitions. [2022-12-06 04:24:15,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 592 flow [2022-12-06 04:24:15,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 511 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-06 04:24:15,218 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 205 flow [2022-12-06 04:24:15,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2022-12-06 04:24:15,220 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-06 04:24:15,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:15,220 INFO L89 Accepts]: Start accepts. Operand has 49 places, 33 transitions, 205 flow [2022-12-06 04:24:15,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:15,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:15,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 205 flow [2022-12-06 04:24:15,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 205 flow [2022-12-06 04:24:15,237 INFO L130 PetriNetUnfolder]: 24/80 cut-off events. [2022-12-06 04:24:15,237 INFO L131 PetriNetUnfolder]: For 135/153 co-relation queries the response was YES. [2022-12-06 04:24:15,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 80 events. 24/80 cut-off events. For 135/153 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 266 event pairs, 2 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 243. Up to 29 conditions per place. [2022-12-06 04:24:15,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 205 flow [2022-12-06 04:24:15,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 04:24:15,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] $Ultimate##0-->L833: Formula: (and (= v_~x$r_buff1_thd2~0_97 v_~x$r_buff0_thd2~0_105) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|) (= v_~x$w_buff0_used~0_335 1) (= v_~x$r_buff0_thd3~0_79 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_302 256) 0)) (not (= (mod v_~x$w_buff0_used~0_335 256) 0)))) 1 0)) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$r_buff1_thd0~0_76 v_~x$r_buff0_thd0~0_75) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_80) (= v_~x$w_buff0~0_234 v_~x$w_buff1~0_203) (= v_~x$w_buff0~0_233 1) (= v_~x$w_buff0_used~0_336 v_~x$w_buff1_used~0_302) (= v_~x$r_buff0_thd1~0_106 v_~x$r_buff1_thd1~0_102) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_234, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_336} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_233, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_203, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_97, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_302, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_102, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_335, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork0_~arg#1.base, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1] and [655] L796-->L812: Formula: (let ((.cse9 (= 0 (mod v_~x$w_buff1_used~0_187 256))) (.cse6 (= (mod v_~x$r_buff1_thd2~0_63 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd2~0_68 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_205 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice2~0_90 256) 0)) (.cse8 (not .cse16)) (.cse7 (not .cse13)) (.cse1 (and .cse6 .cse13)) (.cse2 (and .cse9 .cse13)) (.cse14 (select |v_#memory_int_216| |v_~#x~0.base_146|))) (let ((.cse4 (select .cse14 |v_~#x~0.offset_146|)) (.cse5 (or .cse16 .cse1 .cse2)) (.cse10 (and .cse8 .cse7)) (.cse12 (= (mod v_~x$w_buff1_used~0_186 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_204 256) 0)) (.cse0 (not .cse15))) (and (= v_~x$w_buff1_used~0_186 (ite .cse0 v_~x$w_buff1_used~0_187 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_187 0))) (or (and (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem22_36|) (= |v_P1_#t~mem22_36| .cse4) .cse5) (and (or (not .cse6) .cse7) .cse8 (or (not .cse9) .cse7) (= v_~__unbuffered_p1_EBX~0_20 (ite .cse10 v_~x$w_buff0~0_122 v_~x$w_buff1~0_117)) (= |v_P1Thread1of1ForFork2_#t~mem22_1| |v_P1_#t~mem22_36|))) (= v_~x$flush_delayed~0_64 0) (= |v_P1Thread1of1ForFork2_#t~nondet20_1| v_~weak$$choice2~0_90) (= v_~x$w_buff0~0_122 v_~x$w_buff0~0_121) (= v_~x$r_buff1_thd2~0_62 (ite .cse0 v_~x$r_buff1_thd2~0_63 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd2~0_67 256) 0))) (or (and .cse11 .cse6) .cse3 (and .cse11 .cse12))) v_~x$r_buff1_thd2~0_63 0))) (= |v_P1Thread1of1ForFork2_#t~nondet19_1| v_~weak$$choice0~0_52) (= v_~x$mem_tmp~0_40 .cse4) (= (ite .cse0 v_~x$w_buff0_used~0_205 (ite .cse5 v_~x$w_buff0_used~0_205 (ite .cse10 0 v_~x$w_buff0_used~0_205))) v_~x$w_buff0_used~0_204) (= v_~x$w_buff1~0_117 v_~x$w_buff1~0_116) (= v_~x$r_buff0_thd2~0_67 (ite .cse0 v_~x$r_buff0_thd2~0_68 (ite (or .cse1 (and .cse12 .cse13) .cse3) v_~x$r_buff0_thd2~0_68 (ite (and (not .cse3) .cse7) 0 v_~x$r_buff0_thd2~0_68)))) (= (store |v_#memory_int_216| |v_~#x~0.base_146| (store .cse14 |v_~#x~0.offset_146| |v_P1_#t~ite26_37|)) |v_#memory_int_215|) (or (and .cse15 (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem25_38|) (= |v_P1_#t~ite26_37| |v_P1_#t~mem25_38|)) (and .cse0 (= |v_P1Thread1of1ForFork2_#t~mem25_1| |v_P1_#t~mem25_38|) (= |v_P1_#t~ite26_37| v_~x$mem_tmp~0_40))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, ~#x~0.offset=|v_~#x~0.offset_146|, P1Thread1of1ForFork2_#t~mem22=|v_P1Thread1of1ForFork2_#t~mem22_1|, ~x$w_buff1~0=v_~x$w_buff1~0_117, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, P1Thread1of1ForFork2_#t~nondet19=|v_P1Thread1of1ForFork2_#t~nondet19_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_205, #memory_int=|v_#memory_int_216|, ~#x~0.base=|v_~#x~0.base_146|, P1Thread1of1ForFork2_#t~mem25=|v_P1Thread1of1ForFork2_#t~mem25_1|, P1Thread1of1ForFork2_#t~nondet20=|v_P1Thread1of1ForFork2_#t~nondet20_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, P1Thread1of1ForFork2_#t~mem24=|v_P1Thread1of1ForFork2_#t~mem24_1|, ~x$flush_delayed~0=v_~x$flush_delayed~0_64, ~#x~0.offset=|v_~#x~0.offset_146|, ~x$w_buff1~0=v_~x$w_buff1~0_116, P1Thread1of1ForFork2_#t~mem21=|v_P1Thread1of1ForFork2_#t~mem21_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_186, P1Thread1of1ForFork2_#t~ite23=|v_P1Thread1of1ForFork2_#t~ite23_1|, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, P1Thread1of1ForFork2_#t~ite26=|v_P1Thread1of1ForFork2_#t~ite26_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204, ~weak$$choice0~0=v_~weak$$choice0~0_52, #memory_int=|v_#memory_int_215|, ~#x~0.base=|v_~#x~0.base_146|, ~weak$$choice2~0=v_~weak$$choice2~0_90} AuxVars[|v_P1_#t~ite26_37|, |v_P1_#t~mem25_38|, |v_P1_#t~mem22_36|] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork2_#t~mem24, ~x$flush_delayed~0, P1Thread1of1ForFork2_#t~mem22, ~x$w_buff1~0, P1Thread1of1ForFork2_#t~mem21, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~nondet19, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite26, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P1Thread1of1ForFork2_#t~mem25, ~weak$$choice2~0, P1Thread1of1ForFork2_#t~nondet20] [2022-12-06 04:24:17,637 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:24:17,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2418 [2022-12-06 04:24:17,638 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 202 flow [2022-12-06 04:24:17,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:17,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:17,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:17,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:24:17,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:24:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1689684501, now seen corresponding path program 1 times [2022-12-06 04:24:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107339289] [2022-12-06 04:24:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:24:17,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:24:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:24:17,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:24:17,792 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:24:17,793 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:24:17,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:24:17,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:24:17,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:24:17,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:24:17,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:24:17,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:24:17,796 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:17,801 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:24:17,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:24:17,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:24:17 BasicIcfg [2022-12-06 04:24:17,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:24:17,890 INFO L158 Benchmark]: Toolchain (without parser) took 98264.82ms. Allocated memory was 181.4MB in the beginning and 729.8MB in the end (delta: 548.4MB). Free memory was 156.9MB in the beginning and 454.8MB in the end (delta: -297.9MB). Peak memory consumption was 251.3MB. Max. memory is 8.0GB. [2022-12-06 04:24:17,890 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:24:17,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.22ms. Allocated memory is still 181.4MB. Free memory was 156.9MB in the beginning and 128.8MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:24:17,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 181.4MB. Free memory was 128.8MB in the beginning and 126.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:24:17,890 INFO L158 Benchmark]: Boogie Preprocessor took 69.43ms. Allocated memory is still 181.4MB. Free memory was 126.2MB in the beginning and 123.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:24:17,891 INFO L158 Benchmark]: RCFGBuilder took 1095.25ms. Allocated memory was 181.4MB in the beginning and 280.0MB in the end (delta: 98.6MB). Free memory was 123.6MB in the beginning and 238.3MB in the end (delta: -114.7MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. [2022-12-06 04:24:17,891 INFO L158 Benchmark]: TraceAbstraction took 96407.87ms. Allocated memory was 280.0MB in the beginning and 729.8MB in the end (delta: 449.8MB). Free memory was 237.3MB in the beginning and 454.8MB in the end (delta: -217.5MB). Peak memory consumption was 233.4MB. Max. memory is 8.0GB. [2022-12-06 04:24:17,892 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 181.4MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 625.22ms. Allocated memory is still 181.4MB. Free memory was 156.9MB in the beginning and 128.8MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.44ms. Allocated memory is still 181.4MB. Free memory was 128.8MB in the beginning and 126.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.43ms. Allocated memory is still 181.4MB. Free memory was 126.2MB in the beginning and 123.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1095.25ms. Allocated memory was 181.4MB in the beginning and 280.0MB in the end (delta: 98.6MB). Free memory was 123.6MB in the beginning and 238.3MB in the end (delta: -114.7MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. * TraceAbstraction took 96407.87ms. Allocated memory was 280.0MB in the beginning and 729.8MB in the end (delta: 449.8MB). Free memory was 237.3MB in the beginning and 454.8MB in the end (delta: -217.5MB). Peak memory consumption was 233.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.5s, 130 PlacesBefore, 33 PlacesAfterwards, 122 TransitionsBefore, 24 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1158, independent: 1110, independent conditional: 1110, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1158, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1158, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1158, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1022, independent: 987, independent conditional: 0, independent unconditional: 987, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1022, independent: 976, independent conditional: 0, independent unconditional: 976, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 299, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 278, dependent conditional: 0, dependent unconditional: 278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1158, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1022, unknown conditional: 0, unknown unconditional: 1022] , Statistics on independence cache: Total cache size (in pairs): 1499, Positive cache size: 1464, Positive conditional cache size: 0, Positive unconditional cache size: 1464, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 1, independent unconditional: 33, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 34, independent conditional: 1, independent unconditional: 33, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 1, independent unconditional: 33, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 1, independent unconditional: 33, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 194, dependent conditional: 18, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 50, unknown conditional: 2, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 34, Positive conditional cache size: 1, Positive unconditional cache size: 33, Negative cache size: 16, Negative conditional cache size: 1, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 5, independent unconditional: 29, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 36, Positive conditional cache size: 1, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 4, independent unconditional: 30, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 36, Positive conditional cache size: 1, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 62, independent conditional: 34, independent unconditional: 28, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 62, independent conditional: 34, independent unconditional: 28, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 62, independent conditional: 34, independent unconditional: 28, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 52, independent conditional: 27, independent unconditional: 25, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 46, Positive conditional cache size: 8, Positive unconditional cache size: 38, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 53, independent conditional: 16, independent unconditional: 37, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 53, independent conditional: 16, independent unconditional: 37, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 53, independent conditional: 16, independent unconditional: 37, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 45, independent conditional: 12, independent unconditional: 33, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 54, Positive conditional cache size: 12, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 1, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, 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: 24, independent: 16, independent conditional: 8, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 16, independent conditional: 8, independent unconditional: 8, 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: 24, independent: 16, independent conditional: 8, independent unconditional: 8, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 16, independent conditional: 8, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 54, Positive conditional cache size: 12, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 1, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 41, independent conditional: 17, independent unconditional: 24, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 41, independent conditional: 17, independent unconditional: 24, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 41, independent conditional: 17, independent unconditional: 24, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 36, independent conditional: 15, independent unconditional: 21, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 59, Positive conditional cache size: 14, Positive unconditional cache size: 45, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 47 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 84, independent conditional: 64, independent unconditional: 20, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 84, independent conditional: 64, independent unconditional: 20, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 84, independent conditional: 64, independent unconditional: 20, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 70, independent conditional: 50, independent unconditional: 20, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 15, unknown conditional: 14, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 73, Positive conditional cache size: 28, Positive unconditional cache size: 45, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1684, ((void *)0), P0, ((void *)0))=-3, t1684={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 0 pthread_t t1685; [L860] FCALL, FORK 0 pthread_create(&t1685, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1685, ((void *)0), P1, ((void *)0))=-2, t1684={6:0}, t1685={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t1686; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L862] FCALL, FORK 0 pthread_create(&t1686, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1686, ((void *)0), P2, ((void *)0))=-1, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)1 [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 3 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 862]: 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: 858]: 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, 150 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: 96.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 84.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 1 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=7, InterpolantAutomatonStates: 37, 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.5s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:24:17,929 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...