/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:40:05,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:40:05,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:40:05,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:40:05,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:40:05,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:40:05,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:40:05,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:40:05,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:40:05,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:40:05,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:40:05,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:40:05,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:40:05,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:40:05,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:40:05,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:40:05,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:40:05,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:40:05,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:40:05,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:40:05,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:40:05,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:40:05,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:40:05,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:40:05,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:40:05,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:40:05,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:40:05,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:40:05,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:40:05,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:40:05,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:40:05,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:40:05,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:40:05,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:40:05,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:40:05,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:40:05,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:40:05,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:40:05,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:40:05,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:40:05,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:40:05,804 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-NoLbe.epf [2022-12-05 18:40:05,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:40:05,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:40:05,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:40:05,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:40:05,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:40:05,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:40:05,830 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:40:05,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:40:05,830 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:40:05,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:40:05,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:40:05,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:40:05,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:40:05,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:40:05,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:40:05,831 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:40:05,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:40:05,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:40:05,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:40:05,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:40:05,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:40:05,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:40:05,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:40:05,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:40:05,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:40:05,834 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 18:40:06,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:40:06,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:40:06,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:40:06,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:40:06,239 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:40:06,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-12-05 18:40:07,531 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:40:07,875 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:40:07,876 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-12-05 18:40:07,905 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962fceaa1/f7da50331ab548a885b0344933479584/FLAGda2478ccb [2022-12-05 18:40:07,916 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962fceaa1/f7da50331ab548a885b0344933479584 [2022-12-05 18:40:07,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:40:07,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:40:07,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:40:07,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:40:07,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:40:07,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:40:07" (1/1) ... [2022-12-05 18:40:07,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583c4067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:07, skipping insertion in model container [2022-12-05 18:40:07,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:40:07" (1/1) ... [2022-12-05 18:40:07,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:40:07,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:40:08,107 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-12-05 18:40:08,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:40:08,287 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:40:08,295 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-12-05 18:40:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:40:08,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:40:08,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:40:08,382 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:40:08,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08 WrapperNode [2022-12-05 18:40:08,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:40:08,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:40:08,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:40:08,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:40:08,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,441 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 18:40:08,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:40:08,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:40:08,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:40:08,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:40:08,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,470 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:40:08,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:40:08,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:40:08,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:40:08,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (1/1) ... [2022-12-05 18:40:08,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:40:08,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:40:08,529 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 18:40:08,548 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 18:40:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:40:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:40:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:40:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:40:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:40:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:40:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:40:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:40:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:40:08,564 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 18:40:08,652 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:40:08,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:40:08,905 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:40:09,019 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:40:09,019 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:40:09,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:40:09 BoogieIcfgContainer [2022-12-05 18:40:09,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:40:09,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:40:09,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:40:09,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:40:09,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:40:07" (1/3) ... [2022-12-05 18:40:09,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb8bda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:40:09, skipping insertion in model container [2022-12-05 18:40:09,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:40:08" (2/3) ... [2022-12-05 18:40:09,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb8bda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:40:09, skipping insertion in model container [2022-12-05 18:40:09,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:40:09" (3/3) ... [2022-12-05 18:40:09,026 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-12-05 18:40:09,039 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:40:09,039 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:40:09,039 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:40:09,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:40:09,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 18:40:09,176 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 18:40:09,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:40:09,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 18:40:09,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 18:40:09,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 18:40:09,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:40:09,204 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;@5b754fc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:40:09,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 18:40:09,225 INFO L130 PetriNetUnfolder]: 0/56 cut-off events. [2022-12-05 18:40:09,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:40:09,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:09,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:09,227 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 18:40:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash 192778789, now seen corresponding path program 1 times [2022-12-05 18:40:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:09,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314516245] [2022-12-05 18:40:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:09,766 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 18:40:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:09,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314516245] [2022-12-05 18:40:09,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314516245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:09,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:09,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:40:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447445965] [2022-12-05 18:40:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:09,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:40:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:40:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:40:09,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2022-12-05 18:40:09,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 18:40:09,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:09,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2022-12-05 18:40:09,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:09,941 INFO L130 PetriNetUnfolder]: 57/307 cut-off events. [2022-12-05 18:40:09,942 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 18:40:09,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 307 events. 57/307 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1298 event pairs, 11 based on Foata normal form. 15/305 useless extension candidates. Maximal degree in co-relation 384. Up to 75 conditions per place. [2022-12-05 18:40:09,946 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 13 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-05 18:40:09,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 252 flow [2022-12-05 18:40:09,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:40:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:40:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-12-05 18:40:09,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9314641744548287 [2022-12-05 18:40:09,961 INFO L175 Difference]: Start difference. First operand has 112 places, 104 transitions, 217 flow. Second operand 3 states and 299 transitions. [2022-12-05 18:40:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 252 flow [2022-12-05 18:40:09,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 18:40:09,968 INFO L231 Difference]: Finished difference. Result has 109 places, 100 transitions, 210 flow [2022-12-05 18:40:09,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=109, PETRI_TRANSITIONS=100} [2022-12-05 18:40:09,972 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, -3 predicate places. [2022-12-05 18:40:09,972 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 210 flow [2022-12-05 18:40:09,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 18:40:09,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:09,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:09,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:40:09,974 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 18:40:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1318932085, now seen corresponding path program 1 times [2022-12-05 18:40:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:09,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410151626] [2022-12-05 18:40:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:10,521 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 18:40:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410151626] [2022-12-05 18:40:10,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410151626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:10,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:10,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:40:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928839992] [2022-12-05 18:40:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:10,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:40:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:40:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:40:10,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 107 [2022-12-05 18:40:10,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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 18:40:10,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:10,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 107 [2022-12-05 18:40:10,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:11,299 INFO L130 PetriNetUnfolder]: 1478/3491 cut-off events. [2022-12-05 18:40:11,299 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-05 18:40:11,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 3491 events. 1478/3491 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 27193 event pairs, 231 based on Foata normal form. 0/3388 useless extension candidates. Maximal degree in co-relation 5937. Up to 1143 conditions per place. [2022-12-05 18:40:11,318 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 34 selfloop transitions, 12 changer transitions 82/191 dead transitions. [2022-12-05 18:40:11,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 191 transitions, 656 flow [2022-12-05 18:40:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:40:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:40:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1097 transitions. [2022-12-05 18:40:11,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7886412652767792 [2022-12-05 18:40:11,322 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 210 flow. Second operand 13 states and 1097 transitions. [2022-12-05 18:40:11,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 191 transitions, 656 flow [2022-12-05 18:40:11,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 191 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:40:11,326 INFO L231 Difference]: Finished difference. Result has 130 places, 98 transitions, 297 flow [2022-12-05 18:40:11,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=297, PETRI_PLACES=130, PETRI_TRANSITIONS=98} [2022-12-05 18:40:11,327 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 18 predicate places. [2022-12-05 18:40:11,327 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 98 transitions, 297 flow [2022-12-05 18:40:11,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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 18:40:11,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:11,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:11,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:40:11,328 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 18:40:11,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1971669928, now seen corresponding path program 1 times [2022-12-05 18:40:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:11,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955846834] [2022-12-05 18:40:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:11,768 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 18:40:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:11,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955846834] [2022-12-05 18:40:11,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955846834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:11,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:11,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:40:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035273441] [2022-12-05 18:40:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:11,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:40:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:40:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:40:11,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 107 [2022-12-05 18:40:11,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 98 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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 18:40:11,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:11,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 107 [2022-12-05 18:40:11,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:12,796 INFO L130 PetriNetUnfolder]: 981/1864 cut-off events. [2022-12-05 18:40:12,796 INFO L131 PetriNetUnfolder]: For 4886/6206 co-relation queries the response was YES. [2022-12-05 18:40:12,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 1864 events. 981/1864 cut-off events. For 4886/6206 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10915 event pairs, 88 based on Foata normal form. 46/1856 useless extension candidates. Maximal degree in co-relation 6745. Up to 814 conditions per place. [2022-12-05 18:40:12,820 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 36 selfloop transitions, 10 changer transitions 58/167 dead transitions. [2022-12-05 18:40:12,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 167 transitions, 943 flow [2022-12-05 18:40:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:40:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:40:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1080 transitions. [2022-12-05 18:40:12,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7764198418404026 [2022-12-05 18:40:12,838 INFO L175 Difference]: Start difference. First operand has 130 places, 98 transitions, 297 flow. Second operand 13 states and 1080 transitions. [2022-12-05 18:40:12,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 167 transitions, 943 flow [2022-12-05 18:40:12,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 167 transitions, 895 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-05 18:40:12,868 INFO L231 Difference]: Finished difference. Result has 127 places, 98 transitions, 327 flow [2022-12-05 18:40:12,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=127, PETRI_TRANSITIONS=98} [2022-12-05 18:40:12,869 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 15 predicate places. [2022-12-05 18:40:12,869 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 98 transitions, 327 flow [2022-12-05 18:40:12,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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 18:40:12,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:12,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:12,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:40:12,871 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 18:40:12,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1179590258, now seen corresponding path program 1 times [2022-12-05 18:40:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:12,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751693859] [2022-12-05 18:40:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:13,207 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 18:40:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:13,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751693859] [2022-12-05 18:40:13,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751693859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:13,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:13,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:40:13,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917392962] [2022-12-05 18:40:13,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:13,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:40:13,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:40:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:40:13,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 107 [2022-12-05 18:40:13,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 98 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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 18:40:13,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:13,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 107 [2022-12-05 18:40:13,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:13,913 INFO L130 PetriNetUnfolder]: 1049/2149 cut-off events. [2022-12-05 18:40:13,913 INFO L131 PetriNetUnfolder]: For 7256/9148 co-relation queries the response was YES. [2022-12-05 18:40:13,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8580 conditions, 2149 events. 1049/2149 cut-off events. For 7256/9148 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14267 event pairs, 295 based on Foata normal form. 44/2135 useless extension candidates. Maximal degree in co-relation 8504. Up to 975 conditions per place. [2022-12-05 18:40:13,957 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 40 selfloop transitions, 11 changer transitions 40/154 dead transitions. [2022-12-05 18:40:13,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 154 transitions, 935 flow [2022-12-05 18:40:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:40:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:40:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 836 transitions. [2022-12-05 18:40:13,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7813084112149533 [2022-12-05 18:40:13,960 INFO L175 Difference]: Start difference. First operand has 127 places, 98 transitions, 327 flow. Second operand 10 states and 836 transitions. [2022-12-05 18:40:13,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 154 transitions, 935 flow [2022-12-05 18:40:13,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 154 transitions, 851 flow, removed 30 selfloop flow, removed 12 redundant places. [2022-12-05 18:40:13,991 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 364 flow [2022-12-05 18:40:13,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=364, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2022-12-05 18:40:13,992 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 11 predicate places. [2022-12-05 18:40:13,993 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 364 flow [2022-12-05 18:40:13,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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 18:40:13,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:13,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:40:13,993 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 18:40:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -938526283, now seen corresponding path program 1 times [2022-12-05 18:40:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553710403] [2022-12-05 18:40:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:14,385 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 18:40:14,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:14,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553710403] [2022-12-05 18:40:14,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553710403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:14,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:14,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:40:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980771675] [2022-12-05 18:40:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:14,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:40:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:14,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:40:14,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:40:14,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:40:14,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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 18:40:14,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:14,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:40:14,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:15,270 INFO L130 PetriNetUnfolder]: 1532/2996 cut-off events. [2022-12-05 18:40:15,270 INFO L131 PetriNetUnfolder]: For 8941/13413 co-relation queries the response was YES. [2022-12-05 18:40:15,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10990 conditions, 2996 events. 1532/2996 cut-off events. For 8941/13413 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19846 event pairs, 277 based on Foata normal form. 58/2974 useless extension candidates. Maximal degree in co-relation 10912. Up to 1157 conditions per place. [2022-12-05 18:40:15,288 INFO L137 encePairwiseOnDemand]: 90/107 looper letters, 51 selfloop transitions, 32 changer transitions 94/238 dead transitions. [2022-12-05 18:40:15,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 238 transitions, 1639 flow [2022-12-05 18:40:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 18:40:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 18:40:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1393 transitions. [2022-12-05 18:40:15,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.765805387575591 [2022-12-05 18:40:15,292 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 364 flow. Second operand 17 states and 1393 transitions. [2022-12-05 18:40:15,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 238 transitions, 1639 flow [2022-12-05 18:40:15,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 238 transitions, 1522 flow, removed 43 selfloop flow, removed 7 redundant places. [2022-12-05 18:40:15,328 INFO L231 Difference]: Finished difference. Result has 142 places, 119 transitions, 657 flow [2022-12-05 18:40:15,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=657, PETRI_PLACES=142, PETRI_TRANSITIONS=119} [2022-12-05 18:40:15,330 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 30 predicate places. [2022-12-05 18:40:15,331 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 119 transitions, 657 flow [2022-12-05 18:40:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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 18:40:15,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:15,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:15,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:40:15,331 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 18:40:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1564976083, now seen corresponding path program 2 times [2022-12-05 18:40:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050867015] [2022-12-05 18:40:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:15,654 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 18:40:15,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:15,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050867015] [2022-12-05 18:40:15,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050867015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:15,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:15,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:40:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657135451] [2022-12-05 18:40:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:15,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:40:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:40:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:40:15,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:40:15,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 119 transitions, 657 flow. Second operand has 8 states, 8 states have (on average 75.75) internal successors, (606), 8 states have internal predecessors, (606), 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 18:40:15,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:15,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:40:15,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:16,248 INFO L130 PetriNetUnfolder]: 1349/2645 cut-off events. [2022-12-05 18:40:16,248 INFO L131 PetriNetUnfolder]: For 27495/42877 co-relation queries the response was YES. [2022-12-05 18:40:16,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14912 conditions, 2645 events. 1349/2645 cut-off events. For 27495/42877 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17130 event pairs, 172 based on Foata normal form. 85/2638 useless extension candidates. Maximal degree in co-relation 14818. Up to 1180 conditions per place. [2022-12-05 18:40:16,263 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 43 selfloop transitions, 11 changer transitions 93/208 dead transitions. [2022-12-05 18:40:16,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 208 transitions, 1911 flow [2022-12-05 18:40:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:40:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:40:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 900 transitions. [2022-12-05 18:40:16,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7646559048428208 [2022-12-05 18:40:16,266 INFO L175 Difference]: Start difference. First operand has 142 places, 119 transitions, 657 flow. Second operand 11 states and 900 transitions. [2022-12-05 18:40:16,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 208 transitions, 1911 flow [2022-12-05 18:40:16,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 208 transitions, 1665 flow, removed 123 selfloop flow, removed 12 redundant places. [2022-12-05 18:40:16,294 INFO L231 Difference]: Finished difference. Result has 136 places, 100 transitions, 451 flow [2022-12-05 18:40:16,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=451, PETRI_PLACES=136, PETRI_TRANSITIONS=100} [2022-12-05 18:40:16,297 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 24 predicate places. [2022-12-05 18:40:16,297 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 100 transitions, 451 flow [2022-12-05 18:40:16,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.75) internal successors, (606), 8 states have internal predecessors, (606), 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 18:40:16,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:16,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:16,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:40:16,298 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 18:40:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1139733296, now seen corresponding path program 1 times [2022-12-05 18:40:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:16,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252413498] [2022-12-05 18:40:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:16,743 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 18:40:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252413498] [2022-12-05 18:40:16,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252413498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:16,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:16,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:40:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130233985] [2022-12-05 18:40:16,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:16,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:40:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:40:16,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:40:16,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-12-05 18:40:16,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 100 transitions, 451 flow. Second operand has 11 states, 11 states have (on average 82.54545454545455) internal successors, (908), 11 states have internal predecessors, (908), 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 18:40:16,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:16,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-12-05 18:40:16,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:17,108 INFO L130 PetriNetUnfolder]: 541/1306 cut-off events. [2022-12-05 18:40:17,108 INFO L131 PetriNetUnfolder]: For 6201/6929 co-relation queries the response was YES. [2022-12-05 18:40:17,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 1306 events. 541/1306 cut-off events. For 6201/6929 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8391 event pairs, 169 based on Foata normal form. 70/1335 useless extension candidates. Maximal degree in co-relation 5691. Up to 564 conditions per place. [2022-12-05 18:40:17,122 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 26 selfloop transitions, 14 changer transitions 43/156 dead transitions. [2022-12-05 18:40:17,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 156 transitions, 1127 flow [2022-12-05 18:40:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:40:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:40:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1276 transitions. [2022-12-05 18:40:17,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7950155763239876 [2022-12-05 18:40:17,125 INFO L175 Difference]: Start difference. First operand has 136 places, 100 transitions, 451 flow. Second operand 15 states and 1276 transitions. [2022-12-05 18:40:17,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 156 transitions, 1127 flow [2022-12-05 18:40:17,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 156 transitions, 922 flow, removed 21 selfloop flow, removed 17 redundant places. [2022-12-05 18:40:17,135 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 497 flow [2022-12-05 18:40:17,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=497, PETRI_PLACES=135, PETRI_TRANSITIONS=107} [2022-12-05 18:40:17,136 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 23 predicate places. [2022-12-05 18:40:17,136 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 497 flow [2022-12-05 18:40:17,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.54545454545455) internal successors, (908), 11 states have internal predecessors, (908), 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 18:40:17,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:17,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:17,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:40:17,137 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 18:40:17,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1219513645, now seen corresponding path program 1 times [2022-12-05 18:40:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:17,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355102661] [2022-12-05 18:40:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:17,585 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 18:40:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:17,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355102661] [2022-12-05 18:40:17,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355102661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:17,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:17,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:40:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765490224] [2022-12-05 18:40:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:40:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:40:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:40:17,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-05 18:40:17,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 107 transitions, 497 flow. Second operand has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 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 18:40:17,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:17,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-05 18:40:17,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:17,982 INFO L130 PetriNetUnfolder]: 444/1077 cut-off events. [2022-12-05 18:40:17,983 INFO L131 PetriNetUnfolder]: For 8501/9212 co-relation queries the response was YES. [2022-12-05 18:40:17,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 1077 events. 444/1077 cut-off events. For 8501/9212 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6449 event pairs, 130 based on Foata normal form. 49/1082 useless extension candidates. Maximal degree in co-relation 5535. Up to 540 conditions per place. [2022-12-05 18:40:17,993 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 35 selfloop transitions, 12 changer transitions 26/145 dead transitions. [2022-12-05 18:40:17,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 1099 flow [2022-12-05 18:40:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:40:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:40:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 770 transitions. [2022-12-05 18:40:17,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2022-12-05 18:40:17,996 INFO L175 Difference]: Start difference. First operand has 135 places, 107 transitions, 497 flow. Second operand 9 states and 770 transitions. [2022-12-05 18:40:17,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 1099 flow [2022-12-05 18:40:18,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 145 transitions, 1061 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-05 18:40:18,003 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 605 flow [2022-12-05 18:40:18,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=605, PETRI_PLACES=134, PETRI_TRANSITIONS=113} [2022-12-05 18:40:18,005 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 22 predicate places. [2022-12-05 18:40:18,005 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 605 flow [2022-12-05 18:40:18,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 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 18:40:18,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:18,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:18,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:40:18,006 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 18:40:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash 541126879, now seen corresponding path program 2 times [2022-12-05 18:40:18,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:18,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633404299] [2022-12-05 18:40:18,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:18,467 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 18:40:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:18,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633404299] [2022-12-05 18:40:18,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633404299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:18,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:18,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:40:18,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487401682] [2022-12-05 18:40:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:18,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:40:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:40:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:40:18,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-12-05 18:40:18,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 113 transitions, 605 flow. Second operand has 11 states, 11 states have (on average 82.63636363636364) internal successors, (909), 11 states have internal predecessors, (909), 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 18:40:18,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:18,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-12-05 18:40:18,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:18,862 INFO L130 PetriNetUnfolder]: 438/1142 cut-off events. [2022-12-05 18:40:18,862 INFO L131 PetriNetUnfolder]: For 10991/11686 co-relation queries the response was YES. [2022-12-05 18:40:18,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6135 conditions, 1142 events. 438/1142 cut-off events. For 10991/11686 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7006 event pairs, 139 based on Foata normal form. 51/1130 useless extension candidates. Maximal degree in co-relation 6051. Up to 532 conditions per place. [2022-12-05 18:40:18,872 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 34 selfloop transitions, 14 changer transitions 43/164 dead transitions. [2022-12-05 18:40:18,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 164 transitions, 1503 flow [2022-12-05 18:40:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:40:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:40:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2022-12-05 18:40:18,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8015815959741194 [2022-12-05 18:40:18,875 INFO L175 Difference]: Start difference. First operand has 134 places, 113 transitions, 605 flow. Second operand 13 states and 1115 transitions. [2022-12-05 18:40:18,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 164 transitions, 1503 flow [2022-12-05 18:40:18,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 1422 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-05 18:40:18,885 INFO L231 Difference]: Finished difference. Result has 145 places, 115 transitions, 659 flow [2022-12-05 18:40:18,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=659, PETRI_PLACES=145, PETRI_TRANSITIONS=115} [2022-12-05 18:40:18,886 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 33 predicate places. [2022-12-05 18:40:18,886 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 115 transitions, 659 flow [2022-12-05 18:40:18,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.63636363636364) internal successors, (909), 11 states have internal predecessors, (909), 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 18:40:18,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:18,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:18,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:40:18,888 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 18:40:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 735599409, now seen corresponding path program 3 times [2022-12-05 18:40:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641244935] [2022-12-05 18:40:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:19,339 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 18:40:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641244935] [2022-12-05 18:40:19,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641244935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:19,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:19,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:40:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207549796] [2022-12-05 18:40:19,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:19,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:40:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:40:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:40:19,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:40:19,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 115 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 84.45454545454545) internal successors, (929), 11 states have internal predecessors, (929), 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 18:40:19,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:19,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:40:19,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:19,700 INFO L130 PetriNetUnfolder]: 469/1183 cut-off events. [2022-12-05 18:40:19,700 INFO L131 PetriNetUnfolder]: For 19608/20569 co-relation queries the response was YES. [2022-12-05 18:40:19,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 1183 events. 469/1183 cut-off events. For 19608/20569 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7447 event pairs, 115 based on Foata normal form. 54/1191 useless extension candidates. Maximal degree in co-relation 7784. Up to 550 conditions per place. [2022-12-05 18:40:19,710 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 36 selfloop transitions, 14 changer transitions 45/170 dead transitions. [2022-12-05 18:40:19,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 170 transitions, 1917 flow [2022-12-05 18:40:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:40:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:40:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1138 transitions. [2022-12-05 18:40:19,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.818116462976276 [2022-12-05 18:40:19,713 INFO L175 Difference]: Start difference. First operand has 145 places, 115 transitions, 659 flow. Second operand 13 states and 1138 transitions. [2022-12-05 18:40:19,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 170 transitions, 1917 flow [2022-12-05 18:40:19,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 170 transitions, 1856 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-05 18:40:19,728 INFO L231 Difference]: Finished difference. Result has 150 places, 117 transitions, 754 flow [2022-12-05 18:40:19,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=754, PETRI_PLACES=150, PETRI_TRANSITIONS=117} [2022-12-05 18:40:19,729 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 38 predicate places. [2022-12-05 18:40:19,729 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 117 transitions, 754 flow [2022-12-05 18:40:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.45454545454545) internal successors, (929), 11 states have internal predecessors, (929), 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 18:40:19,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:19,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:19,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:40:19,730 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 18:40:19,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1293005672, now seen corresponding path program 1 times [2022-12-05 18:40:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:19,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751521592] [2022-12-05 18:40:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:19,879 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 18:40:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:19,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751521592] [2022-12-05 18:40:19,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751521592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:19,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:19,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:40:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865706330] [2022-12-05 18:40:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:19,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:40:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:40:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:40:19,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:40:19,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 117 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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 18:40:19,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:19,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:40:19,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:20,442 INFO L130 PetriNetUnfolder]: 1889/3848 cut-off events. [2022-12-05 18:40:20,442 INFO L131 PetriNetUnfolder]: For 118950/119085 co-relation queries the response was YES. [2022-12-05 18:40:20,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24920 conditions, 3848 events. 1889/3848 cut-off events. For 118950/119085 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 28312 event pairs, 170 based on Foata normal form. 94/3793 useless extension candidates. Maximal degree in co-relation 24831. Up to 1278 conditions per place. [2022-12-05 18:40:20,480 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 68 selfloop transitions, 13 changer transitions 62/219 dead transitions. [2022-12-05 18:40:20,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 219 transitions, 2870 flow [2022-12-05 18:40:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:40:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:40:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 912 transitions. [2022-12-05 18:40:20,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8523364485981308 [2022-12-05 18:40:20,482 INFO L175 Difference]: Start difference. First operand has 150 places, 117 transitions, 754 flow. Second operand 10 states and 912 transitions. [2022-12-05 18:40:20,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 219 transitions, 2870 flow [2022-12-05 18:40:20,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 219 transitions, 2231 flow, removed 290 selfloop flow, removed 13 redundant places. [2022-12-05 18:40:20,540 INFO L231 Difference]: Finished difference. Result has 146 places, 122 transitions, 667 flow [2022-12-05 18:40:20,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=667, PETRI_PLACES=146, PETRI_TRANSITIONS=122} [2022-12-05 18:40:20,541 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 34 predicate places. [2022-12-05 18:40:20,541 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 122 transitions, 667 flow [2022-12-05 18:40:20,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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 18:40:20,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:20,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:20,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:40:20,542 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 18:40:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1152954649, now seen corresponding path program 1 times [2022-12-05 18:40:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:20,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611106567] [2022-12-05 18:40:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:20,693 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 18:40:20,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:20,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611106567] [2022-12-05 18:40:20,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611106567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:20,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:20,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:40:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106280343] [2022-12-05 18:40:20,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:20,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:40:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:40:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:40:20,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:40:20,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 122 transitions, 667 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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 18:40:20,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:20,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:40:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:21,295 INFO L130 PetriNetUnfolder]: 1520/3259 cut-off events. [2022-12-05 18:40:21,295 INFO L131 PetriNetUnfolder]: For 65819/65930 co-relation queries the response was YES. [2022-12-05 18:40:21,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19979 conditions, 3259 events. 1520/3259 cut-off events. For 65819/65930 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24690 event pairs, 67 based on Foata normal form. 135/3318 useless extension candidates. Maximal degree in co-relation 19893. Up to 1020 conditions per place. [2022-12-05 18:40:21,335 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 70 selfloop transitions, 24 changer transitions 70/240 dead transitions. [2022-12-05 18:40:21,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 240 transitions, 2715 flow [2022-12-05 18:40:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:40:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:40:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1179 transitions. [2022-12-05 18:40:21,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8475916606757729 [2022-12-05 18:40:21,353 INFO L175 Difference]: Start difference. First operand has 146 places, 122 transitions, 667 flow. Second operand 13 states and 1179 transitions. [2022-12-05 18:40:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 240 transitions, 2715 flow [2022-12-05 18:40:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 240 transitions, 2671 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-05 18:40:21,423 INFO L231 Difference]: Finished difference. Result has 162 places, 134 transitions, 809 flow [2022-12-05 18:40:21,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=809, PETRI_PLACES=162, PETRI_TRANSITIONS=134} [2022-12-05 18:40:21,424 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 50 predicate places. [2022-12-05 18:40:21,424 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 134 transitions, 809 flow [2022-12-05 18:40:21,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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 18:40:21,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:21,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:21,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:40:21,425 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:40:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1627744665, now seen corresponding path program 1 times [2022-12-05 18:40:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:21,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467120673] [2022-12-05 18:40:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:21,585 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 18:40:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:21,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467120673] [2022-12-05 18:40:21,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467120673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:21,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:21,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:40:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079933334] [2022-12-05 18:40:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:40:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:40:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:40:21,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:40:21,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 134 transitions, 809 flow. Second operand has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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 18:40:21,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:21,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:40:21,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:22,116 INFO L130 PetriNetUnfolder]: 1214/2895 cut-off events. [2022-12-05 18:40:22,116 INFO L131 PetriNetUnfolder]: For 60704/60808 co-relation queries the response was YES. [2022-12-05 18:40:22,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18515 conditions, 2895 events. 1214/2895 cut-off events. For 60704/60808 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23670 event pairs, 60 based on Foata normal form. 86/2914 useless extension candidates. Maximal degree in co-relation 18422. Up to 841 conditions per place. [2022-12-05 18:40:22,131 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 40 selfloop transitions, 22 changer transitions 87/223 dead transitions. [2022-12-05 18:40:22,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 223 transitions, 2335 flow [2022-12-05 18:40:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 18:40:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 18:40:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1419 transitions. [2022-12-05 18:40:22,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8288551401869159 [2022-12-05 18:40:22,134 INFO L175 Difference]: Start difference. First operand has 162 places, 134 transitions, 809 flow. Second operand 16 states and 1419 transitions. [2022-12-05 18:40:22,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 223 transitions, 2335 flow [2022-12-05 18:40:22,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 223 transitions, 2097 flow, removed 112 selfloop flow, removed 5 redundant places. [2022-12-05 18:40:22,207 INFO L231 Difference]: Finished difference. Result has 179 places, 119 transitions, 649 flow [2022-12-05 18:40:22,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=649, PETRI_PLACES=179, PETRI_TRANSITIONS=119} [2022-12-05 18:40:22,207 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 67 predicate places. [2022-12-05 18:40:22,207 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 119 transitions, 649 flow [2022-12-05 18:40:22,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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 18:40:22,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:22,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:22,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:40:22,209 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:40:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1071970518, now seen corresponding path program 1 times [2022-12-05 18:40:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:22,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463097104] [2022-12-05 18:40:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:23,126 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 18:40:23,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:23,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463097104] [2022-12-05 18:40:23,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463097104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:23,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:23,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-05 18:40:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816862401] [2022-12-05 18:40:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:23,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 18:40:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 18:40:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-05 18:40:23,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2022-12-05 18:40:23,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 119 transitions, 649 flow. Second operand has 14 states, 14 states have (on average 79.71428571428571) internal successors, (1116), 14 states have internal predecessors, (1116), 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 18:40:23,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:23,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2022-12-05 18:40:23,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:23,378 INFO L130 PetriNetUnfolder]: 189/1157 cut-off events. [2022-12-05 18:40:23,378 INFO L131 PetriNetUnfolder]: For 4462/4571 co-relation queries the response was YES. [2022-12-05 18:40:23,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4159 conditions, 1157 events. 189/1157 cut-off events. For 4462/4571 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10980 event pairs, 11 based on Foata normal form. 1/1097 useless extension candidates. Maximal degree in co-relation 4057. Up to 176 conditions per place. [2022-12-05 18:40:23,385 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 22 selfloop transitions, 8 changer transitions 12/130 dead transitions. [2022-12-05 18:40:23,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 130 transitions, 837 flow [2022-12-05 18:40:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:40:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:40:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 893 transitions. [2022-12-05 18:40:23,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7587085811384877 [2022-12-05 18:40:23,386 INFO L175 Difference]: Start difference. First operand has 179 places, 119 transitions, 649 flow. Second operand 11 states and 893 transitions. [2022-12-05 18:40:23,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 130 transitions, 837 flow [2022-12-05 18:40:23,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 130 transitions, 627 flow, removed 78 selfloop flow, removed 32 redundant places. [2022-12-05 18:40:23,403 INFO L231 Difference]: Finished difference. Result has 148 places, 115 transitions, 490 flow [2022-12-05 18:40:23,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=490, PETRI_PLACES=148, PETRI_TRANSITIONS=115} [2022-12-05 18:40:23,404 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 36 predicate places. [2022-12-05 18:40:23,404 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 115 transitions, 490 flow [2022-12-05 18:40:23,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.71428571428571) internal successors, (1116), 14 states have internal predecessors, (1116), 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 18:40:23,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:23,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:40:23,405 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:40:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2017282776, now seen corresponding path program 2 times [2022-12-05 18:40:23,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:23,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062475127] [2022-12-05 18:40:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:40:23,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:40:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:40:23,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:40:23,476 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:40:23,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 18:40:23,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 18:40:23,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 18:40:23,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 18:40:23,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 18:40:23,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 18:40:23,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:40:23,479 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:23,483 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:40:23,483 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:40:23,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:40:23 BasicIcfg [2022-12-05 18:40:23,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:40:23,538 INFO L158 Benchmark]: Toolchain (without parser) took 15618.87ms. Allocated memory was 209.7MB in the beginning and 663.7MB in the end (delta: 454.0MB). Free memory was 184.8MB in the beginning and 441.8MB in the end (delta: -257.0MB). Peak memory consumption was 197.9MB. Max. memory is 8.0GB. [2022-12-05 18:40:23,538 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:40:23,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.93ms. Allocated memory is still 209.7MB. Free memory was 184.6MB in the beginning and 158.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 18:40:23,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.46ms. Allocated memory is still 209.7MB. Free memory was 158.4MB in the beginning and 155.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 18:40:23,539 INFO L158 Benchmark]: Boogie Preprocessor took 41.66ms. Allocated memory is still 209.7MB. Free memory was 155.2MB in the beginning and 153.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:40:23,539 INFO L158 Benchmark]: RCFGBuilder took 536.46ms. Allocated memory is still 209.7MB. Free memory was 153.6MB in the beginning and 116.9MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-05 18:40:23,539 INFO L158 Benchmark]: TraceAbstraction took 14515.84ms. Allocated memory was 209.7MB in the beginning and 663.7MB in the end (delta: 454.0MB). Free memory was 116.4MB in the beginning and 441.8MB in the end (delta: -325.4MB). Peak memory consumption was 129.7MB. Max. memory is 8.0GB. [2022-12-05 18:40:23,540 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.13ms. Allocated memory is still 209.7MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 460.93ms. Allocated memory is still 209.7MB. Free memory was 184.6MB in the beginning and 158.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.46ms. Allocated memory is still 209.7MB. Free memory was 158.4MB in the beginning and 155.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.66ms. Allocated memory is still 209.7MB. Free memory was 155.2MB in the beginning and 153.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 536.46ms. Allocated memory is still 209.7MB. Free memory was 153.6MB in the beginning and 116.9MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14515.84ms. Allocated memory was 209.7MB in the beginning and 663.7MB in the end (delta: 454.0MB). Free memory was 116.4MB in the beginning and 441.8MB in the end (delta: -325.4MB). Peak memory consumption was 129.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=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] [L818] 0 pthread_t t2028; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028={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] [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028, ((void *)0), P0, ((void *)0))=-2, t2028={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] [L820] 0 pthread_t t2029; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={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] [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029, ((void *)0), P1, ((void *)0))=-1, t2028={5:0}, t2029={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] [L822] 0 pthread_t t2030; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={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] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2030, ((void *)0), P2, ((void *)0))=0, t2028={5:0}, t2029={6:0}, t2030={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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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 [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 987 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 987 mSDsluCounter, 1026 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 812 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2024 IncrementalHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 214 mSDtfsCounter, 2024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=12, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1103 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 5810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 18:40:23,557 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...