/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/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:20:03,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:20:03,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:20:03,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:20:03,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:20:03,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:20:03,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:20:03,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:20:03,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:20:03,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:20:03,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:20:03,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:20:03,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:20:03,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:20:03,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:20:03,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:20:03,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:20:03,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:20:03,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:20:03,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:20:03,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:20:03,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:20:03,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:20:03,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:20:03,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:20:03,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:20:03,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:20:03,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:20:03,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:20:03,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:20:03,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:20:03,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:20:03,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:20:03,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:20:03,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:20:03,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:20:03,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:20:03,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:20:03,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:20:03,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:20:03,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:20:03,932 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:20:03,957 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:20:03,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:20:03,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:20:03,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:20:03,959 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:20:03,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:20:03,960 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:20:03,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:20:03,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:20:03,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:20:03,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:20:03,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:20:03,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:20:03,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:20:03,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:20:03,963 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:20:04,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:20:04,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:20:04,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:20:04,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:20:04,233 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:20:04,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:20:05,316 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:20:05,570 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:20:05,571 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:20:05,589 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160e9e241/fd19c122f3da4b4eae8a6ce30b67ebd6/FLAG3dc5741f7 [2022-12-06 04:20:05,600 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160e9e241/fd19c122f3da4b4eae8a6ce30b67ebd6 [2022-12-06 04:20:05,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:20:05,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:20:05,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:20:05,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:20:05,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:20:05,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:20:05" (1/1) ... [2022-12-06 04:20:05,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b19bcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:05, skipping insertion in model container [2022-12-06 04:20:05,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:20:05" (1/1) ... [2022-12-06 04:20:05,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:20:05,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:20:05,801 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:20:05,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:05,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:05,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:20:05,983 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:20:05,994 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:20:06,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:06,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:06,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:20:06,068 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:20:06,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06 WrapperNode [2022-12-06 04:20:06,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:20:06,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:20:06,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:20:06,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:20:06,074 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:20:06" (1/1) ... [2022-12-06 04:20:06,094 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:20:06" (1/1) ... [2022-12-06 04:20:06,113 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-06 04:20:06,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:20:06,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:20:06,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:20:06,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:20:06,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:20:06,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:20:06,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:20:06,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:20:06,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (1/1) ... [2022-12-06 04:20:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:20:06,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:20:06,193 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:20:06,212 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:20:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:20:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:20:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:20:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:20:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:20:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:20:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:20:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:20:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:20:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:20:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:20:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:20:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:20:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:20:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:20:06,233 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:20:06,346 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:20:06,347 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:20:06,652 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:20:06,758 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:20:06,758 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:20:06,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:06 BoogieIcfgContainer [2022-12-06 04:20:06,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:20:06,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:20:06,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:20:06,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:20:06,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:20:05" (1/3) ... [2022-12-06 04:20:06,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce3fcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:20:06, skipping insertion in model container [2022-12-06 04:20:06,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:06" (2/3) ... [2022-12-06 04:20:06,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce3fcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:20:06, skipping insertion in model container [2022-12-06 04:20:06,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:06" (3/3) ... [2022-12-06 04:20:06,788 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:20:06,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:20:06,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:20:06,801 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:20:06,831 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:20:06,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:20:06,902 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:20:06,902 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:06,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:20:06,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:20:06,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 04:20:06,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:06,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:20:06,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 04:20:06,961 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:20:06,962 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:06,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:20:06,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:20:06,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 04:20:10,388 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 04:20:10,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:20:10,421 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;@43ae72dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:20:10,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:20:10,423 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:20:10,423 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:10,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:10,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:20:10,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 462838, now seen corresponding path program 1 times [2022-12-06 04:20:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:10,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771513905] [2022-12-06 04:20:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:10,735 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:20:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771513905] [2022-12-06 04:20:10,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771513905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:10,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:10,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:20:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104788988] [2022-12-06 04:20:10,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:10,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:20:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:10,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:20:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:20:10,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 04:20:10,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:10,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:10,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 04:20:10,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:11,096 INFO L130 PetriNetUnfolder]: 1290/2069 cut-off events. [2022-12-06 04:20:11,096 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:20:11,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 2069 events. 1290/2069 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11248 event pairs, 207 based on Foata normal form. 0/1888 useless extension candidates. Maximal degree in co-relation 4016. Up to 1549 conditions per place. [2022-12-06 04:20:11,106 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-06 04:20:11,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2022-12-06 04:20:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:20:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:20:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:20:11,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 04:20:11,116 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:20:11,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2022-12-06 04:20:11,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:20:11,120 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-06 04:20:11,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 04:20:11,124 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 04:20:11,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:11,125 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-06 04:20:11,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:11,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:11,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-06 04:20:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 04:20:11,132 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:20:11,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:11,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:20:11,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 04:20:11,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 04:20:11,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:20:11,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 04:20:11,268 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:20:11,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:11,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:11,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:11,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:20:11,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1537826934, now seen corresponding path program 1 times [2022-12-06 04:20:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:11,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202245021] [2022-12-06 04:20:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:11,576 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:20:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:11,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202245021] [2022-12-06 04:20:11,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202245021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:11,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:11,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:20:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562984831] [2022-12-06 04:20:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:11,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:20:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:20:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:20:11,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:20:11,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:11,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:11,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:20:11,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:11,863 INFO L130 PetriNetUnfolder]: 1767/2677 cut-off events. [2022-12-06 04:20:11,864 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-06 04:20:11,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 2677 events. 1767/2677 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12924 event pairs, 623 based on Foata normal form. 107/2784 useless extension candidates. Maximal degree in co-relation 5575. Up to 1388 conditions per place. [2022-12-06 04:20:11,873 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-06 04:20:11,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 162 flow [2022-12-06 04:20:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:20:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:20:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:20:11,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-06 04:20:11,874 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:20:11,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 162 flow [2022-12-06 04:20:11,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:20:11,876 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 94 flow [2022-12-06 04:20:11,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 04:20:11,876 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places. [2022-12-06 04:20:11,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:11,877 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 94 flow [2022-12-06 04:20:11,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:11,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:11,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 94 flow [2022-12-06 04:20:11,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 94 flow [2022-12-06 04:20:11,890 INFO L130 PetriNetUnfolder]: 48/178 cut-off events. [2022-12-06 04:20:11,890 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 04:20:11,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 178 events. 48/178 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 980 event pairs, 18 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 327. Up to 61 conditions per place. [2022-12-06 04:20:11,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 94 flow [2022-12-06 04:20:11,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 04:20:11,912 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:11,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 04:20:11,913 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 94 flow [2022-12-06 04:20:11,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:11,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:11,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:11,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:20:11,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:11,915 INFO L85 PathProgramCache]: Analyzing trace with hash 427992629, now seen corresponding path program 1 times [2022-12-06 04:20:11,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:11,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452080539] [2022-12-06 04:20:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:12,034 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:20:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:12,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452080539] [2022-12-06 04:20:12,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452080539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:12,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:12,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:20:12,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563554279] [2022-12-06 04:20:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:12,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:12,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:20:12,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 94 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:20:12,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:12,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:20:12,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:12,306 INFO L130 PetriNetUnfolder]: 1726/2613 cut-off events. [2022-12-06 04:20:12,306 INFO L131 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2022-12-06 04:20:12,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 2613 events. 1726/2613 cut-off events. For 1025/1025 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12410 event pairs, 146 based on Foata normal form. 5/2618 useless extension candidates. Maximal degree in co-relation 6548. Up to 1297 conditions per place. [2022-12-06 04:20:12,316 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-06 04:20:12,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 256 flow [2022-12-06 04:20:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:20:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:20:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 04:20:12,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:20:12,317 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 94 flow. Second operand 4 states and 46 transitions. [2022-12-06 04:20:12,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 256 flow [2022-12-06 04:20:12,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:20:12,321 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 150 flow [2022-12-06 04:20:12,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 04:20:12,322 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-06 04:20:12,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:12,322 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 150 flow [2022-12-06 04:20:12,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:12,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:12,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 150 flow [2022-12-06 04:20:12,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 150 flow [2022-12-06 04:20:12,335 INFO L130 PetriNetUnfolder]: 41/160 cut-off events. [2022-12-06 04:20:12,335 INFO L131 PetriNetUnfolder]: For 85/97 co-relation queries the response was YES. [2022-12-06 04:20:12,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 160 events. 41/160 cut-off events. For 85/97 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 840 event pairs, 11 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 352. Up to 54 conditions per place. [2022-12-06 04:20:12,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 150 flow [2022-12-06 04:20:12,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:20:12,338 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:12,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 04:20:12,339 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 150 flow [2022-12-06 04:20:12,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:20:12,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:12,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:20:12,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash 427994024, now seen corresponding path program 1 times [2022-12-06 04:20:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929844675] [2022-12-06 04:20:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:12,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:12,460 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:20:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929844675] [2022-12-06 04:20:12,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929844675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:12,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:12,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:20:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271044708] [2022-12-06 04:20:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:12,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:12,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:20:12,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 150 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:20:12,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:12,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:20:12,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:12,756 INFO L130 PetriNetUnfolder]: 1687/2554 cut-off events. [2022-12-06 04:20:12,756 INFO L131 PetriNetUnfolder]: For 1962/1962 co-relation queries the response was YES. [2022-12-06 04:20:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6956 conditions, 2554 events. 1687/2554 cut-off events. For 1962/1962 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12074 event pairs, 229 based on Foata normal form. 8/2562 useless extension candidates. Maximal degree in co-relation 6941. Up to 1264 conditions per place. [2022-12-06 04:20:12,767 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 43 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2022-12-06 04:20:12,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 344 flow [2022-12-06 04:20:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:20:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:20:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:20:12,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:20:12,769 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 150 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:20:12,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 344 flow [2022-12-06 04:20:12,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:20:12,774 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 232 flow [2022-12-06 04:20:12,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 04:20:12,775 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 04:20:12,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:12,776 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 232 flow [2022-12-06 04:20:12,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:12,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:12,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 232 flow [2022-12-06 04:20:12,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 232 flow [2022-12-06 04:20:12,789 INFO L130 PetriNetUnfolder]: 35/144 cut-off events. [2022-12-06 04:20:12,789 INFO L131 PetriNetUnfolder]: For 234/252 co-relation queries the response was YES. [2022-12-06 04:20:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 144 events. 35/144 cut-off events. For 234/252 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 747 event pairs, 5 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 393. Up to 46 conditions per place. [2022-12-06 04:20:12,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 232 flow [2022-12-06 04:20:12,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 04:20:12,837 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:12,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 04:20:12,841 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 232 flow [2022-12-06 04:20:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:20:12,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:12,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:12,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:20:12,842 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 382868937, now seen corresponding path program 1 times [2022-12-06 04:20:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:12,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183295487] [2022-12-06 04:20:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:12,953 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:20:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:12,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183295487] [2022-12-06 04:20:12,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183295487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:12,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:12,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:20:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865890856] [2022-12-06 04:20:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:12,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:12,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:12,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:20:12,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:12,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:12,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:20:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:13,204 INFO L130 PetriNetUnfolder]: 996/1703 cut-off events. [2022-12-06 04:20:13,205 INFO L131 PetriNetUnfolder]: For 2434/2507 co-relation queries the response was YES. [2022-12-06 04:20:13,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4915 conditions, 1703 events. 996/1703 cut-off events. For 2434/2507 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9274 event pairs, 157 based on Foata normal form. 219/1917 useless extension candidates. Maximal degree in co-relation 4896. Up to 958 conditions per place. [2022-12-06 04:20:13,212 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 63 selfloop transitions, 8 changer transitions 11/91 dead transitions. [2022-12-06 04:20:13,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 705 flow [2022-12-06 04:20:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:20:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:20:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 04:20:13,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 04:20:13,214 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 232 flow. Second operand 5 states and 66 transitions. [2022-12-06 04:20:13,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 91 transitions, 705 flow [2022-12-06 04:20:13,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 91 transitions, 701 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 04:20:13,224 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 290 flow [2022-12-06 04:20:13,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-06 04:20:13,225 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 04:20:13,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:13,225 INFO L89 Accepts]: Start accepts. Operand has 48 places, 43 transitions, 290 flow [2022-12-06 04:20:13,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:13,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:13,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 290 flow [2022-12-06 04:20:13,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 290 flow [2022-12-06 04:20:13,251 INFO L130 PetriNetUnfolder]: 138/369 cut-off events. [2022-12-06 04:20:13,251 INFO L131 PetriNetUnfolder]: For 469/550 co-relation queries the response was YES. [2022-12-06 04:20:13,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 369 events. 138/369 cut-off events. For 469/550 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2396 event pairs, 49 based on Foata normal form. 8/349 useless extension candidates. Maximal degree in co-relation 1102. Up to 190 conditions per place. [2022-12-06 04:20:13,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 290 flow [2022-12-06 04:20:13,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 04:20:13,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L836-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [421] L814-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-06 04:20:13,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L836-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [420] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 04:20:13,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L836-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [440] L761-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res#1.base_15| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P0Thread1of1ForFork2_#res#1.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_15|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 04:20:13,375 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:20:13,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-06 04:20:13,377 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 296 flow [2022-12-06 04:20:13,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:13,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:13,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:13,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:20:13,378 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash 942150050, now seen corresponding path program 1 times [2022-12-06 04:20:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:13,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194962991] [2022-12-06 04:20:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:13,528 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:20:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:13,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194962991] [2022-12-06 04:20:13,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194962991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:13,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:13,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:20:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195200095] [2022-12-06 04:20:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:13,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:20:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:20:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:20:13,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:20:13,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:13,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:13,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:20:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:13,800 INFO L130 PetriNetUnfolder]: 1304/2263 cut-off events. [2022-12-06 04:20:13,800 INFO L131 PetriNetUnfolder]: For 4981/4994 co-relation queries the response was YES. [2022-12-06 04:20:13,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8470 conditions, 2263 events. 1304/2263 cut-off events. For 4981/4994 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12936 event pairs, 532 based on Foata normal form. 47/2304 useless extension candidates. Maximal degree in co-relation 8446. Up to 1205 conditions per place. [2022-12-06 04:20:13,810 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 43 selfloop transitions, 7 changer transitions 10/63 dead transitions. [2022-12-06 04:20:13,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 531 flow [2022-12-06 04:20:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:20:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:20:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 04:20:13,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-06 04:20:13,812 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 296 flow. Second operand 3 states and 45 transitions. [2022-12-06 04:20:13,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 531 flow [2022-12-06 04:20:13,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 512 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 04:20:13,818 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 268 flow [2022-12-06 04:20:13,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-06 04:20:13,820 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 04:20:13,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:13,820 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 268 flow [2022-12-06 04:20:13,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:13,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:13,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 268 flow [2022-12-06 04:20:13,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 268 flow [2022-12-06 04:20:13,849 INFO L130 PetriNetUnfolder]: 160/411 cut-off events. [2022-12-06 04:20:13,849 INFO L131 PetriNetUnfolder]: For 621/664 co-relation queries the response was YES. [2022-12-06 04:20:13,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 411 events. 160/411 cut-off events. For 621/664 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2647 event pairs, 70 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1224. Up to 241 conditions per place. [2022-12-06 04:20:13,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 268 flow [2022-12-06 04:20:13,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 04:20:13,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:13,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 04:20:13,888 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 268 flow [2022-12-06 04:20:13,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:13,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:13,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:13,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:20:13,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash -378032532, now seen corresponding path program 1 times [2022-12-06 04:20:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:13,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740851209] [2022-12-06 04:20:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:14,011 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:20:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:14,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740851209] [2022-12-06 04:20:14,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740851209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:14,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:14,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:20:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292140638] [2022-12-06 04:20:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:14,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:20:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:20:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:20:14,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:20:14,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 268 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:20:14,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:14,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:20:14,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:14,224 INFO L130 PetriNetUnfolder]: 670/1255 cut-off events. [2022-12-06 04:20:14,224 INFO L131 PetriNetUnfolder]: For 2171/2197 co-relation queries the response was YES. [2022-12-06 04:20:14,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 1255 events. 670/1255 cut-off events. For 2171/2197 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6978 event pairs, 119 based on Foata normal form. 162/1403 useless extension candidates. Maximal degree in co-relation 4365. Up to 489 conditions per place. [2022-12-06 04:20:14,230 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 60 selfloop transitions, 11 changer transitions 19/97 dead transitions. [2022-12-06 04:20:14,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 828 flow [2022-12-06 04:20:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:20:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:20:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 04:20:14,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-06 04:20:14,231 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 268 flow. Second operand 6 states and 80 transitions. [2022-12-06 04:20:14,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 828 flow [2022-12-06 04:20:14,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 97 transitions, 773 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 04:20:14,236 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 335 flow [2022-12-06 04:20:14,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-06 04:20:14,236 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 04:20:14,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:14,236 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 335 flow [2022-12-06 04:20:14,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:14,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:14,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 335 flow [2022-12-06 04:20:14,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 335 flow [2022-12-06 04:20:14,258 INFO L130 PetriNetUnfolder]: 87/293 cut-off events. [2022-12-06 04:20:14,258 INFO L131 PetriNetUnfolder]: For 700/797 co-relation queries the response was YES. [2022-12-06 04:20:14,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 293 events. 87/293 cut-off events. For 700/797 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1874 event pairs, 10 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 1135. Up to 183 conditions per place. [2022-12-06 04:20:14,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 335 flow [2022-12-06 04:20:14,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 04:20:14,283 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:20:14,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 04:20:14,284 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 327 flow [2022-12-06 04:20:14,284 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:20:14,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:14,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:14,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:20:14,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1477489416, now seen corresponding path program 1 times [2022-12-06 04:20:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989287426] [2022-12-06 04:20:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:14,451 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:20:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989287426] [2022-12-06 04:20:14,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989287426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:14,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:20:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774800510] [2022-12-06 04:20:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:14,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:20:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:20:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:20:14,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:20:14,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:14,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:14,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:20:14,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:14,625 INFO L130 PetriNetUnfolder]: 422/809 cut-off events. [2022-12-06 04:20:14,625 INFO L131 PetriNetUnfolder]: For 1616/1637 co-relation queries the response was YES. [2022-12-06 04:20:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 809 events. 422/809 cut-off events. For 1616/1637 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4149 event pairs, 110 based on Foata normal form. 49/845 useless extension candidates. Maximal degree in co-relation 3071. Up to 299 conditions per place. [2022-12-06 04:20:14,629 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 44 selfloop transitions, 10 changer transitions 23/81 dead transitions. [2022-12-06 04:20:14,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 678 flow [2022-12-06 04:20:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:20:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:20:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-06 04:20:14,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2022-12-06 04:20:14,635 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 327 flow. Second operand 7 states and 72 transitions. [2022-12-06 04:20:14,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 678 flow [2022-12-06 04:20:14,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 654 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 04:20:14,641 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 265 flow [2022-12-06 04:20:14,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2022-12-06 04:20:14,642 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-06 04:20:14,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:14,642 INFO L89 Accepts]: Start accepts. Operand has 57 places, 35 transitions, 265 flow [2022-12-06 04:20:14,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:14,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:14,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 35 transitions, 265 flow [2022-12-06 04:20:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 35 transitions, 265 flow [2022-12-06 04:20:14,667 INFO L130 PetriNetUnfolder]: 19/77 cut-off events. [2022-12-06 04:20:14,667 INFO L131 PetriNetUnfolder]: For 152/158 co-relation queries the response was YES. [2022-12-06 04:20:14,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 77 events. 19/77 cut-off events. For 152/158 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 246 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 283. Up to 25 conditions per place. [2022-12-06 04:20:14,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 35 transitions, 265 flow [2022-12-06 04:20:14,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:20:14,965 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:20:14,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-06 04:20:14,966 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 261 flow [2022-12-06 04:20:14,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:14,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:14,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:14,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:20:14,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1157189812, now seen corresponding path program 1 times [2022-12-06 04:20:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:14,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665786423] [2022-12-06 04:20:14,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:15,611 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:20:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:15,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665786423] [2022-12-06 04:20:15,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665786423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:15,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:15,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:20:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591928379] [2022-12-06 04:20:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:15,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:20:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:15,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:20:15,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:20:15,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:20:15,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:15,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:15,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:20:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:15,800 INFO L130 PetriNetUnfolder]: 221/428 cut-off events. [2022-12-06 04:20:15,800 INFO L131 PetriNetUnfolder]: For 1031/1033 co-relation queries the response was YES. [2022-12-06 04:20:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 428 events. 221/428 cut-off events. For 1031/1033 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1948 event pairs, 16 based on Foata normal form. 3/430 useless extension candidates. Maximal degree in co-relation 1727. Up to 220 conditions per place. [2022-12-06 04:20:15,802 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 36 selfloop transitions, 4 changer transitions 27/71 dead transitions. [2022-12-06 04:20:15,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 639 flow [2022-12-06 04:20:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:20:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:20:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 04:20:15,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2022-12-06 04:20:15,803 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 261 flow. Second operand 6 states and 55 transitions. [2022-12-06 04:20:15,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 639 flow [2022-12-06 04:20:15,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 527 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-12-06 04:20:15,807 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 214 flow [2022-12-06 04:20:15,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-12-06 04:20:15,807 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 04:20:15,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:15,807 INFO L89 Accepts]: Start accepts. Operand has 48 places, 33 transitions, 214 flow [2022-12-06 04:20:15,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:15,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:15,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 214 flow [2022-12-06 04:20:15,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 214 flow [2022-12-06 04:20:15,815 INFO L130 PetriNetUnfolder]: 20/81 cut-off events. [2022-12-06 04:20:15,815 INFO L131 PetriNetUnfolder]: For 146/153 co-relation queries the response was YES. [2022-12-06 04:20:15,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 81 events. 20/81 cut-off events. For 146/153 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 297 event pairs, 0 based on Foata normal form. 4/85 useless extension candidates. Maximal degree in co-relation 237. Up to 22 conditions per place. [2022-12-06 04:20:15,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 214 flow [2022-12-06 04:20:15,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 04:20:16,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L754-->P0EXIT: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_593 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd1~0_221 256)))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_160 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~z$w_buff1_used~0_521 256))) .cse3)) (.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_594 256) 0)) .cse5))) (and (= |v_P0Thread1of1ForFork2_#res#1.offset_37| 0) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_521) v_~z$w_buff1_used~0_520) (= v_~z$r_buff1_thd1~0_159 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_220 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_520 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_160)) (= v_~z~0_438 (ite .cse4 v_~z$w_buff0~0_349 (ite .cse1 v_~z$w_buff1~0_312 v_~z~0_439))) (= v_~z$r_buff0_thd1~0_220 (ite .cse0 0 v_~z$r_buff0_thd1~0_221)) (= v_~__unbuffered_cnt~0_207 (+ v_~__unbuffered_cnt~0_208 1)) (= v_~z$w_buff0_used~0_593 (ite .cse4 0 v_~z$w_buff0_used~0_594)) (= |v_P0Thread1of1ForFork2_#res#1.base_37| 0)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_594, ~z$w_buff0~0=v_~z$w_buff0~0_349, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_160, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_521, ~z$w_buff1~0=v_~z$w_buff1~0_312, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_208, ~z~0=v_~z~0_439, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_221} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_37|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_593, ~z$w_buff0~0=v_~z$w_buff0~0_349, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_37|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_520, ~z$w_buff1~0=v_~z$w_buff1~0_312, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ~z~0=v_~z~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_220} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [447] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_172 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_547 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_168 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_548 256) 0)))) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_480 256) 0))))) (and (= v_~z$w_buff0_used~0_547 (ite .cse0 0 v_~z$w_buff0_used~0_548)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= v_~y~0_73 2) (= v_~x~0_69 2) (= v_~__unbuffered_p2_EAX~0_98 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= v_~z$r_buff0_thd0~0_167 (ite .cse1 0 v_~z$r_buff0_thd0~0_168)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= v_~z~0_398 (ite .cse0 v_~z$w_buff0~0_323 (ite .cse2 v_~z$w_buff1~0_291 v_~z~0_399))) (= v_~z$w_buff1_used~0_479 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_480)) (= v_~z$r_buff1_thd0~0_171 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_167 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_479 256) 0)))) 0 v_~z$r_buff1_thd0~0_172)) (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_197 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_168, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_548, ~z$w_buff0~0=v_~z$w_buff0~0_323, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_172, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_480, ~z$w_buff1~0=v_~z$w_buff1~0_291, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_197, ~z~0=v_~z~0_399, ~y~0=v_~y~0_73, ~x~0=v_~x~0_69} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_547, ~z$w_buff0~0=v_~z$w_buff0~0_323, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_479, ~z$w_buff1~0=v_~z$w_buff1~0_291, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_197, ~z~0=v_~z~0_398, ~y~0=v_~y~0_73, ~x~0=v_~x~0_69, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:20:16,496 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:20:16,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 690 [2022-12-06 04:20:16,497 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 220 flow [2022-12-06 04:20:16,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:16,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:16,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:16,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:20:16,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:20:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1119460633, now seen corresponding path program 1 times [2022-12-06 04:20:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:16,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6783746] [2022-12-06 04:20:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:20:16,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:20:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:20:16,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:20:16,587 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:20:16,587 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:20:16,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:20:16,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:20:16,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:20:16,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:20:16,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:20:16,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:20:16,590 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:16,593 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:20:16,593 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:20:16,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:20:16 BasicIcfg [2022-12-06 04:20:16,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:20:16,655 INFO L158 Benchmark]: Toolchain (without parser) took 11052.78ms. Allocated memory was 189.8MB in the beginning and 484.4MB in the end (delta: 294.6MB). Free memory was 164.2MB in the beginning and 198.5MB in the end (delta: -34.2MB). Peak memory consumption was 261.6MB. Max. memory is 8.0GB. [2022-12-06 04:20:16,655 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:20:16,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.80ms. Allocated memory is still 189.8MB. Free memory was 163.9MB in the beginning and 137.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:20:16,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.39ms. Allocated memory is still 189.8MB. Free memory was 137.7MB in the beginning and 135.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:20:16,656 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 189.8MB. Free memory was 135.1MB in the beginning and 133.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:20:16,656 INFO L158 Benchmark]: RCFGBuilder took 613.41ms. Allocated memory is still 189.8MB. Free memory was 133.5MB in the beginning and 98.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 04:20:16,656 INFO L158 Benchmark]: TraceAbstraction took 9871.38ms. Allocated memory was 189.8MB in the beginning and 484.4MB in the end (delta: 294.6MB). Free memory was 165.6MB in the beginning and 198.5MB in the end (delta: -32.9MB). Peak memory consumption was 261.3MB. Max. memory is 8.0GB. [2022-12-06 04:20:16,657 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.10ms. Allocated memory is still 189.8MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.80ms. Allocated memory is still 189.8MB. Free memory was 163.9MB in the beginning and 137.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.39ms. Allocated memory is still 189.8MB. Free memory was 137.7MB in the beginning and 135.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 189.8MB. Free memory was 135.1MB in the beginning and 133.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 613.41ms. Allocated memory is still 189.8MB. Free memory was 133.5MB in the beginning and 98.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9871.38ms. Allocated memory was 189.8MB in the beginning and 484.4MB in the end (delta: 294.6MB). Free memory was 165.6MB in the beginning and 198.5MB in the end (delta: -32.9MB). Peak memory consumption was 261.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 112 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 1524, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1159, independent: 1126, independent conditional: 0, independent unconditional: 1126, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1159, independent: 1107, independent conditional: 0, independent unconditional: 1107, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1577, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1159, unknown conditional: 0, unknown unconditional: 1159] , Statistics on independence cache: Total cache size (in pairs): 1776, Positive cache size: 1743, Positive conditional cache size: 0, Positive unconditional cache size: 1743, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 167, independent conditional: 167, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 109, independent: 88, independent conditional: 16, independent unconditional: 72, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 109, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 87, dependent conditional: 28, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 79, independent conditional: 16, independent unconditional: 63, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 109, unknown conditional: 22, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 93, Positive conditional cache size: 17, Positive unconditional cache size: 76, Negative cache size: 21, Negative conditional cache size: 6, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 15, independent unconditional: 73, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 17, Positive unconditional cache size: 90, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 73, 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: 89, independent: 73, independent conditional: 21, independent unconditional: 52, 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: 89, independent: 73, independent conditional: 0, independent unconditional: 73, 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: 89, independent: 73, independent conditional: 0, independent unconditional: 73, 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: 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: 89, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 17, Positive unconditional cache size: 90, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 34, independent conditional: 8, independent unconditional: 26, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 115, Positive conditional cache size: 17, Positive unconditional cache size: 98, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 244, independent conditional: 124, independent unconditional: 120, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 244, independent conditional: 33, independent unconditional: 211, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 244, independent conditional: 33, independent unconditional: 211, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 236, independent conditional: 31, independent unconditional: 205, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 130, Positive conditional cache size: 21, Positive unconditional cache size: 109, Negative cache size: 34, Negative conditional cache size: 6, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 91, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 130, Positive conditional cache size: 21, Positive unconditional cache size: 109, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 235, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 235, independent: 189, independent conditional: 91, independent unconditional: 98, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 235, independent: 189, independent conditional: 29, independent unconditional: 160, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 235, independent: 189, independent conditional: 29, independent unconditional: 160, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, independent: 183, independent conditional: 23, independent unconditional: 160, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 136, Positive conditional cache size: 27, Positive unconditional cache size: 109, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 53 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 78, independent conditional: 38, independent unconditional: 40, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 74, independent conditional: 6, independent unconditional: 68, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 143, Positive conditional cache size: 29, Positive unconditional cache size: 114, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 117, independent conditional: 87, independent unconditional: 30, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 117, independent conditional: 63, independent unconditional: 54, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 117, independent conditional: 63, independent unconditional: 54, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 11, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 100, independent conditional: 52, independent unconditional: 48, dependent: 36, dependent conditional: 21, dependent unconditional: 15, unknown: 19, unknown conditional: 13, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 193, Positive conditional cache size: 40, Positive unconditional cache size: 153, Negative cache size: 40, Negative conditional cache size: 8, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-2, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=-1, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 655 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 9 mSDtfsCounter, 655 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:20:16,693 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...