/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:26:28,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:26:28,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:26:28,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:26:28,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:26:28,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:26:28,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:26:28,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:26:28,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:26:28,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:26:28,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:26:28,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:26:28,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:26:28,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:26:28,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:26:28,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:26:28,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:26:28,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:26:28,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:26:28,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:26:28,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:26:28,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:26:28,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:26:28,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:26:28,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:26:28,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:26:28,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:26:28,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:26:28,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:26:28,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:26:28,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:26:28,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:26:28,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:26:28,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:26:28,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:26:28,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:26:28,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:26:28,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:26:28,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:26:28,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:26:28,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:26:28,959 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-SemanticLbe.epf [2022-12-05 20:26:28,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:26:28,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:26:28,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:26:28,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:26:28,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:26:28,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:26:28,996 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:26:28,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:26:28,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:26:28,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:26:28,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:26:28,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:26:28,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:26:28,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:26:28,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:26:28,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:26:28,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:26:28,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:26:29,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:26:29,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:26:29,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:26:29,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:26:29,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:26:29,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:26:29,001 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-05 20:26:29,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:26:29,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:26:29,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:26:29,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:26:29,327 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:26:29,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 20:26:30,488 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:26:30,746 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:26:30,747 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 20:26:30,769 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b7de815b/e6363a02cbf14e6c8220931cd23dc48a/FLAGb501cc6d8 [2022-12-05 20:26:30,782 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b7de815b/e6363a02cbf14e6c8220931cd23dc48a [2022-12-05 20:26:30,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:26:30,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:26:30,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:26:30,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:26:30,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:26:30,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:26:30" (1/1) ... [2022-12-05 20:26:30,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391abb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:30, skipping insertion in model container [2022-12-05 20:26:30,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:26:30" (1/1) ... [2022-12-05 20:26:30,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:26:30,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:26:30,956 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-05 20:26:31,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:26:31,181 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:26:31,195 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-05 20:26:31,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:31,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:31,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:26:31,280 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:26:31,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31 WrapperNode [2022-12-05 20:26:31,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:26:31,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:26:31,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:26:31,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:26:31,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,323 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-05 20:26:31,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:26:31,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:26:31,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:26:31,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:26:31,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:26:31,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:26:31,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:26:31,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:26:31,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (1/1) ... [2022-12-05 20:26:31,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:26:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:26:31,408 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-05 20:26:31,429 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-05 20:26:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:26:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:26:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:26:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:26:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:26:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:26:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:26:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:26:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:26:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:26:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:26:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:26:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:26:31,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:26:31,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:26:31,452 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:26:31,636 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:26:31,638 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:26:31,968 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:26:32,101 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:26:32,102 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:26:32,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:26:32 BoogieIcfgContainer [2022-12-05 20:26:32,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:26:32,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:26:32,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:26:32,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:26:32,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:26:30" (1/3) ... [2022-12-05 20:26:32,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56da1321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:26:32, skipping insertion in model container [2022-12-05 20:26:32,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:31" (2/3) ... [2022-12-05 20:26:32,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56da1321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:26:32, skipping insertion in model container [2022-12-05 20:26:32,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:26:32" (3/3) ... [2022-12-05 20:26:32,114 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 20:26:32,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:26:32,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:26:32,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:26:32,187 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:26:32,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-05 20:26:32,287 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 20:26:32,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:32,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:26:32,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-05 20:26:32,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-05 20:26:32,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:26:32,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-05 20:26:32,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-05 20:26:32,386 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 20:26:32,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:32,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:26:32,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-05 20:26:32,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-05 20:26:36,872 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-05 20:26:36,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:26:36,892 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=PETRI_NET, 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;@be84c1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:26:36,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:26:36,895 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:26:36,895 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:36,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:36,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:26:36,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash 440892574, now seen corresponding path program 1 times [2022-12-05 20:26:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:36,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681975355] [2022-12-05 20:26:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:37,297 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-05 20:26:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:37,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681975355] [2022-12-05 20:26:37,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681975355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:37,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:37,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:26:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781859890] [2022-12-05 20:26:37,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:37,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:26:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:26:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:26:37,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:37,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 20:26:37,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:37,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:37,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:37,642 INFO L130 PetriNetUnfolder]: 879/1440 cut-off events. [2022-12-05 20:26:37,642 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 20:26:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1440 events. 879/1440 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7244 event pairs, 144 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2796. Up to 1060 conditions per place. [2022-12-05 20:26:37,658 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-05 20:26:37,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-05 20:26:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 20:26:37,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-05 20:26:37,670 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-05 20:26:37,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-05 20:26:37,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:26:37,674 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-05 20:26:37,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-05 20:26:37,679 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 20:26:37,679 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 50 flow [2022-12-05 20:26:37,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 20:26:37,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:37,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:37,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:26:37,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2145675422, now seen corresponding path program 1 times [2022-12-05 20:26:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279751693] [2022-12-05 20:26:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:37,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:37,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279751693] [2022-12-05 20:26:37,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279751693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:37,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:37,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:26:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223652491] [2022-12-05 20:26:37,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:37,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:26:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:37,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:26:37,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:26:37,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:37,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-05 20:26:37,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:37,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:37,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:38,011 INFO L130 PetriNetUnfolder]: 556/899 cut-off events. [2022-12-05 20:26:38,012 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-05 20:26:38,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 899 events. 556/899 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4088 event pairs, 160 based on Foata normal form. 4/902 useless extension candidates. Maximal degree in co-relation 1855. Up to 815 conditions per place. [2022-12-05 20:26:38,016 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 26 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-05 20:26:38,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 136 flow [2022-12-05 20:26:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 20:26:38,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-05 20:26:38,019 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 50 flow. Second operand 3 states and 36 transitions. [2022-12-05 20:26:38,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 136 flow [2022-12-05 20:26:38,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:38,020 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-05 20:26:38,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-05 20:26:38,022 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-05 20:26:38,023 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-05 20:26:38,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-05 20:26:38,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:38,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:38,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:26:38,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2091430240, now seen corresponding path program 1 times [2022-12-05 20:26:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217495476] [2022-12-05 20:26:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:38,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217495476] [2022-12-05 20:26:38,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217495476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:38,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:38,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435401065] [2022-12-05 20:26:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:38,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:38,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 20:26:38,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:38,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 20:26:38,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:38,476 INFO L130 PetriNetUnfolder]: 817/1238 cut-off events. [2022-12-05 20:26:38,476 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-12-05 20:26:38,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 1238 events. 817/1238 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5396 event pairs, 93 based on Foata normal form. 20/1256 useless extension candidates. Maximal degree in co-relation 2756. Up to 673 conditions per place. [2022-12-05 20:26:38,485 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 42 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-05 20:26:38,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 233 flow [2022-12-05 20:26:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:26:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:26:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-05 20:26:38,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2022-12-05 20:26:38,486 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 5 states and 56 transitions. [2022-12-05 20:26:38,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 233 flow [2022-12-05 20:26:38,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:38,488 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 117 flow [2022-12-05 20:26:38,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-05 20:26:38,489 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-05 20:26:38,489 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 117 flow [2022-12-05 20:26:38,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:38,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:38,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:26:38,490 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2091430116, now seen corresponding path program 1 times [2022-12-05 20:26:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:38,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999873811] [2022-12-05 20:26:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:38,705 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-05 20:26:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:38,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999873811] [2022-12-05 20:26:38,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999873811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:38,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:38,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396937387] [2022-12-05 20:26:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:38,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:38,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:38,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:38,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:38,898 INFO L130 PetriNetUnfolder]: 615/984 cut-off events. [2022-12-05 20:26:38,898 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-05 20:26:38,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 984 events. 615/984 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4456 event pairs, 147 based on Foata normal form. 12/989 useless extension candidates. Maximal degree in co-relation 2690. Up to 807 conditions per place. [2022-12-05 20:26:38,906 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-05 20:26:38,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 213 flow [2022-12-05 20:26:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 20:26:38,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2022-12-05 20:26:38,907 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 117 flow. Second operand 3 states and 37 transitions. [2022-12-05 20:26:38,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 213 flow [2022-12-05 20:26:38,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:38,911 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 128 flow [2022-12-05 20:26:38,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-05 20:26:38,912 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 20:26:38,912 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 128 flow [2022-12-05 20:26:38,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:38,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:38,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:26:38,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -409830714, now seen corresponding path program 1 times [2022-12-05 20:26:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:38,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384321522] [2022-12-05 20:26:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:39,056 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-05 20:26:39,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:39,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384321522] [2022-12-05 20:26:39,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384321522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:39,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:39,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839433300] [2022-12-05 20:26:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:39,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:39,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:39,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:39,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 128 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-05 20:26:39,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:39,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:39,210 INFO L130 PetriNetUnfolder]: 597/970 cut-off events. [2022-12-05 20:26:39,211 INFO L131 PetriNetUnfolder]: For 1006/1006 co-relation queries the response was YES. [2022-12-05 20:26:39,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 970 events. 597/970 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4277 event pairs, 135 based on Foata normal form. 8/974 useless extension candidates. Maximal degree in co-relation 2714. Up to 703 conditions per place. [2022-12-05 20:26:39,218 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 27 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 20:26:39,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 208 flow [2022-12-05 20:26:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 20:26:39,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-05 20:26:39,220 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 128 flow. Second operand 3 states and 33 transitions. [2022-12-05 20:26:39,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 208 flow [2022-12-05 20:26:39,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:39,223 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 134 flow [2022-12-05 20:26:39,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-05 20:26:39,224 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-05 20:26:39,224 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 134 flow [2022-12-05 20:26:39,224 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-05 20:26:39,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:39,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:39,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:26:39,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1119107384, now seen corresponding path program 1 times [2022-12-05 20:26:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:39,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416779821] [2022-12-05 20:26:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:39,356 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-05 20:26:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:39,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416779821] [2022-12-05 20:26:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416779821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:39,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:39,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001969930] [2022-12-05 20:26:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:39,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:39,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 20:26:39,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:26:39,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:39,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 20:26:39,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:39,580 INFO L130 PetriNetUnfolder]: 895/1376 cut-off events. [2022-12-05 20:26:39,580 INFO L131 PetriNetUnfolder]: For 1747/1747 co-relation queries the response was YES. [2022-12-05 20:26:39,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3762 conditions, 1376 events. 895/1376 cut-off events. For 1747/1747 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6085 event pairs, 232 based on Foata normal form. 48/1420 useless extension candidates. Maximal degree in co-relation 3744. Up to 543 conditions per place. [2022-12-05 20:26:39,588 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 28 selfloop transitions, 3 changer transitions 11/43 dead transitions. [2022-12-05 20:26:39,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 258 flow [2022-12-05 20:26:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-05 20:26:39,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-05 20:26:39,590 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 134 flow. Second operand 4 states and 42 transitions. [2022-12-05 20:26:39,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 258 flow [2022-12-05 20:26:39,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:39,594 INFO L231 Difference]: Finished difference. Result has 42 places, 20 transitions, 94 flow [2022-12-05 20:26:39,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=20} [2022-12-05 20:26:39,595 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-05 20:26:39,595 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 20 transitions, 94 flow [2022-12-05 20:26:39,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:26:39,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:39,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:39,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:26:39,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1420389656, now seen corresponding path program 1 times [2022-12-05 20:26:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:39,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559359926] [2022-12-05 20:26:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:39,715 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-05 20:26:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:39,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559359926] [2022-12-05 20:26:39,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559359926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:39,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:39,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178855998] [2022-12-05 20:26:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:39,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 20:26:39,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 20 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:39,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:39,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 20:26:39,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:39,930 INFO L130 PetriNetUnfolder]: 613/969 cut-off events. [2022-12-05 20:26:39,930 INFO L131 PetriNetUnfolder]: For 2301/2301 co-relation queries the response was YES. [2022-12-05 20:26:39,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 969 events. 613/969 cut-off events. For 2301/2301 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4169 event pairs, 214 based on Foata normal form. 45/1010 useless extension candidates. Maximal degree in co-relation 2743. Up to 388 conditions per place. [2022-12-05 20:26:39,935 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 24 selfloop transitions, 3 changer transitions 11/39 dead transitions. [2022-12-05 20:26:39,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 241 flow [2022-12-05 20:26:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 20:26:39,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-05 20:26:39,939 INFO L175 Difference]: Start difference. First operand has 42 places, 20 transitions, 94 flow. Second operand 4 states and 44 transitions. [2022-12-05 20:26:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 241 flow [2022-12-05 20:26:39,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 179 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-12-05 20:26:39,945 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 70 flow [2022-12-05 20:26:39,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2022-12-05 20:26:39,945 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-05 20:26:39,946 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 70 flow [2022-12-05 20:26:39,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:39,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:39,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:39,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:26:39,946 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -274371360, now seen corresponding path program 1 times [2022-12-05 20:26:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:39,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766439469] [2022-12-05 20:26:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:40,080 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-05 20:26:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:40,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766439469] [2022-12-05 20:26:40,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766439469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:40,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:40,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524023421] [2022-12-05 20:26:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:40,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:40,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:40,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:40,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:40,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:40,199 INFO L130 PetriNetUnfolder]: 214/378 cut-off events. [2022-12-05 20:26:40,200 INFO L131 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES. [2022-12-05 20:26:40,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 378 events. 214/378 cut-off events. For 171/172 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1409 event pairs, 46 based on Foata normal form. 40/417 useless extension candidates. Maximal degree in co-relation 925. Up to 241 conditions per place. [2022-12-05 20:26:40,202 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 24 selfloop transitions, 4 changer transitions 18/48 dead transitions. [2022-12-05 20:26:40,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 241 flow [2022-12-05 20:26:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:26:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:26:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 20:26:40,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2022-12-05 20:26:40,203 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 70 flow. Second operand 5 states and 58 transitions. [2022-12-05 20:26:40,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 241 flow [2022-12-05 20:26:40,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 223 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 20:26:40,205 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 94 flow [2022-12-05 20:26:40,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-05 20:26:40,206 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-05 20:26:40,206 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 94 flow [2022-12-05 20:26:40,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:40,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:40,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:26:40,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1536801548, now seen corresponding path program 1 times [2022-12-05 20:26:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:40,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140713677] [2022-12-05 20:26:40,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:40,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:40,334 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-05 20:26:40,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:40,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140713677] [2022-12-05 20:26:40,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140713677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:40,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:40,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426319240] [2022-12-05 20:26:40,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:40,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:40,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:40,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:40,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:40,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:40,457 INFO L130 PetriNetUnfolder]: 100/203 cut-off events. [2022-12-05 20:26:40,457 INFO L131 PetriNetUnfolder]: For 111/112 co-relation queries the response was YES. [2022-12-05 20:26:40,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 203 events. 100/203 cut-off events. For 111/112 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 663 event pairs, 17 based on Foata normal form. 25/227 useless extension candidates. Maximal degree in co-relation 628. Up to 88 conditions per place. [2022-12-05 20:26:40,458 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 28 selfloop transitions, 7 changer transitions 16/53 dead transitions. [2022-12-05 20:26:40,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 312 flow [2022-12-05 20:26:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:26:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:26:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-05 20:26:40,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:26:40,460 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 94 flow. Second operand 6 states and 65 transitions. [2022-12-05 20:26:40,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 312 flow [2022-12-05 20:26:40,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:40,462 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 144 flow [2022-12-05 20:26:40,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2022-12-05 20:26:40,463 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-05 20:26:40,463 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 144 flow [2022-12-05 20:26:40,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:40,463 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-05 20:26:40,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:26:40,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 240208513, now seen corresponding path program 1 times [2022-12-05 20:26:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:40,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354215942] [2022-12-05 20:26:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:40,646 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-05 20:26:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354215942] [2022-12-05 20:26:40,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354215942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:40,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:40,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:26:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384864637] [2022-12-05 20:26:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:40,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:40,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:40,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 144 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-05 20:26:40,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:40,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:40,763 INFO L130 PetriNetUnfolder]: 54/120 cut-off events. [2022-12-05 20:26:40,764 INFO L131 PetriNetUnfolder]: For 150/151 co-relation queries the response was YES. [2022-12-05 20:26:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 120 events. 54/120 cut-off events. For 150/151 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 307 event pairs, 14 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 408. Up to 48 conditions per place. [2022-12-05 20:26:40,765 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 25 selfloop transitions, 10 changer transitions 8/45 dead transitions. [2022-12-05 20:26:40,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 309 flow [2022-12-05 20:26:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:26:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:26:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-05 20:26:40,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241758241758242 [2022-12-05 20:26:40,766 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 144 flow. Second operand 7 states and 59 transitions. [2022-12-05 20:26:40,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 309 flow [2022-12-05 20:26:40,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 253 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-05 20:26:40,769 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 136 flow [2022-12-05 20:26:40,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2022-12-05 20:26:40,769 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-05 20:26:40,769 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 136 flow [2022-12-05 20:26:40,770 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-05 20:26:40,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:40,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:40,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:26:40,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:40,771 INFO L85 PathProgramCache]: Analyzing trace with hash -553241180, now seen corresponding path program 1 times [2022-12-05 20:26:40,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:40,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323641444] [2022-12-05 20:26:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:41,422 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-05 20:26:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:41,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323641444] [2022-12-05 20:26:41,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323641444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:41,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:41,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:26:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421341186] [2022-12-05 20:26:41,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:41,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:26:41,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:41,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:26:41,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:26:41,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:26:41,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-05 20:26:41,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:41,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:26:41,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:41,582 INFO L130 PetriNetUnfolder]: 56/128 cut-off events. [2022-12-05 20:26:41,582 INFO L131 PetriNetUnfolder]: For 201/201 co-relation queries the response was YES. [2022-12-05 20:26:41,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 128 events. 56/128 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 333 event pairs, 12 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 420. Up to 45 conditions per place. [2022-12-05 20:26:41,583 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 25 selfloop transitions, 3 changer transitions 23/53 dead transitions. [2022-12-05 20:26:41,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 397 flow [2022-12-05 20:26:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:26:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:26:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-05 20:26:41,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-05 20:26:41,585 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 136 flow. Second operand 7 states and 52 transitions. [2022-12-05 20:26:41,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 397 flow [2022-12-05 20:26:41,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 315 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-05 20:26:41,587 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 112 flow [2022-12-05 20:26:41,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-12-05 20:26:41,588 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-05 20:26:41,588 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 112 flow [2022-12-05 20:26:41,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-05 20:26:41,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:41,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:41,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:26:41,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1889688216, now seen corresponding path program 2 times [2022-12-05 20:26:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:41,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613942928] [2022-12-05 20:26:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:26:41,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:26:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:26:41,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:26:41,686 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:26:41,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:26:41,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:26:41,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:26:41,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:26:41,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:26:41,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:26:41,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:26:41,690 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:41,696 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:26:41,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:26:41,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:26:41 BasicIcfg [2022-12-05 20:26:41,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:26:41,765 INFO L158 Benchmark]: Toolchain (without parser) took 10979.33ms. Allocated memory was 255.9MB in the beginning and 468.7MB in the end (delta: 212.9MB). Free memory was 230.9MB in the beginning and 378.1MB in the end (delta: -147.2MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. [2022-12-05 20:26:41,765 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 255.9MB. Free memory was 232.5MB in the beginning and 232.4MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:26:41,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.37ms. Allocated memory is still 255.9MB. Free memory was 230.3MB in the beginning and 204.6MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:26:41,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.41ms. Allocated memory is still 255.9MB. Free memory was 204.6MB in the beginning and 202.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:26:41,766 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 255.9MB. Free memory was 202.0MB in the beginning and 200.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:26:41,766 INFO L158 Benchmark]: RCFGBuilder took 735.51ms. Allocated memory is still 255.9MB. Free memory was 200.3MB in the beginning and 168.5MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 20:26:41,767 INFO L158 Benchmark]: TraceAbstraction took 9658.16ms. Allocated memory was 255.9MB in the beginning and 468.7MB in the end (delta: 212.9MB). Free memory was 168.0MB in the beginning and 378.1MB in the end (delta: -210.1MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. [2022-12-05 20:26:41,768 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.15ms. Allocated memory is still 255.9MB. Free memory was 232.5MB in the beginning and 232.4MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.37ms. Allocated memory is still 255.9MB. Free memory was 230.3MB in the beginning and 204.6MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.41ms. Allocated memory is still 255.9MB. Free memory was 204.6MB in the beginning and 202.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 255.9MB. Free memory was 202.0MB in the beginning and 200.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 735.51ms. Allocated memory is still 255.9MB. Free memory was 200.3MB in the beginning and 168.5MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9658.16ms. Allocated memory was 255.9MB in the beginning and 468.7MB in the end (delta: 212.9MB). Free memory was 168.0MB in the beginning and 378.1MB in the end (delta: -210.1MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 113 PlacesBefore, 35 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 1445, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1188, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1188, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1496, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1188, unknown conditional: 0, unknown unconditional: 1188] , Statistics on independence cache: Total cache size (in pairs): 1849, Positive cache size: 1814, Positive conditional cache size: 0, Positive unconditional cache size: 1814, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-1, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=1, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 4 mSDtfsCounter, 624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=9, InterpolantAutomatonStates: 50, 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, 2.1s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-05 20:26:41,802 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...